Index of /~nad/listings/dependently-typed-syntax

[ICO]NameLast modifiedSizeDescription

[DIR]Parent Directory   -  
[TXT]Agda.Builtin.Bool.html 11-Mar-2016 15:44 4.4K 
[TXT]Agda.Builtin.Equalit..>11-Mar-2016 15:44 4.2K 
[TXT]Agda.Builtin.Nat.html 11-Mar-2016 15:44 30K 
[TXT]Agda.Builtin.TrustMe..>11-Mar-2016 15:44 3.1K 
[TXT]Agda.Builtin.Unit.html 11-Mar-2016 15:44 2.3K 
[TXT]Agda.Primitive.html 11-Mar-2016 15:44 6.4K 
[TXT]Agda.css 11-Mar-2016 15:44 1.2K 
[TXT]Category.Applicative..>11-Mar-2016 15:44 60K 
[TXT]Category.Functor.html 11-Mar-2016 15:44 8.1K 
[TXT]Category.Monad.Ident..>11-Mar-2016 15:44 6.2K 
[TXT]Category.Monad.Index..>11-Mar-2016 15:44 45K 
[TXT]Category.Monad.html 11-Mar-2016 15:44 17K 
[TXT]Data.Bool.Base.html 11-Mar-2016 15:44 21K 
[TXT]Data.Empty.html 11-Mar-2016 15:44 4.2K 
[TXT]Data.Maybe.Base.html 11-Mar-2016 15:44 58K 
[TXT]Data.Maybe.html 11-Mar-2016 15:44 69K 
[TXT]Data.Nat.Base.html 11-Mar-2016 15:44 99K 
[TXT]Data.Nat.html 11-Mar-2016 15:44 34K 
[TXT]Data.Product.html 11-Mar-2016 15:44 94K 
[TXT]Data.Sum.html 11-Mar-2016 15:44 39K 
[TXT]Data.Unit.Base.html 11-Mar-2016 15:44 3.6K 
[TXT]Data.Unit.NonEta.html 11-Mar-2016 15:44 12K 
[TXT]Data.Unit.html 11-Mar-2016 15:44 20K 
[TXT]Function.Bijection.html11-Mar-2016 15:44 40K 
[TXT]Function.Equality.html 11-Mar-2016 15:44 66K 
[TXT]Function.Equivalence..>11-Mar-2016 15:44 66K 
[TXT]Function.Injection.html11-Mar-2016 15:44 30K 
[TXT]Function.Inverse.html 11-Mar-2016 15:44 91K 
[TXT]Function.LeftInverse..>11-Mar-2016 15:44 62K 
[TXT]Function.Surjection...>11-Mar-2016 15:44 46K 
[TXT]Function.html 11-Mar-2016 15:44 70K 
[TXT]Level.html 11-Mar-2016 15:44 5.6K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 88K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 123K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 63K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 256K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 123K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 199K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 93K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 74K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 51K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 33K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 237K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 227K 
[TXT]README.DependentlyTy..>11-Mar-2016 15:44 133K 
[TXT]README.html 11-Mar-2016 15:44 13K 
[TXT]Relation.Binary.Cons..>11-Mar-2016 15:44 11K 
[TXT]Relation.Binary.Cons..>11-Mar-2016 15:44 119K 
[TXT]Relation.Binary.Core..>11-Mar-2016 15:44 124K 
[TXT]Relation.Binary.EqRe..>11-Mar-2016 15:44 6.7K 
[TXT]Relation.Binary.Hete..>11-Mar-2016 15:44 9.7K 
[TXT]Relation.Binary.Inde..>11-Mar-2016 15:44 40K 
[TXT]Relation.Binary.Inde..>11-Mar-2016 15:44 15K 
[TXT]Relation.Binary.Part..>11-Mar-2016 15:44 4.6K 
[TXT]Relation.Binary.Preo..>11-Mar-2016 15:44 23K 
[TXT]Relation.Binary.Prop..>11-Mar-2016 15:44 17K 
[TXT]Relation.Binary.Prop..>11-Mar-2016 15:44 8.9K 
[TXT]Relation.Binary.Prop..>11-Mar-2016 15:44 140K 
[TXT]Relation.Binary.html 11-Mar-2016 15:44 160K 
[TXT]Relation.Nullary.Dec..>11-Mar-2016 15:44 68K 
[TXT]Relation.Nullary.Pro..>11-Mar-2016 15:44 9.0K 
[TXT]Relation.Nullary.html 11-Mar-2016 15:44 7.4K 
[TXT]Relation.Unary.html 11-Mar-2016 15:44 124K 
[TXT]Universe.html 11-Mar-2016 15:44 11K 
[TXT]deBruijn.Context.Bas..>11-Mar-2016 15:44 338K 
[TXT]deBruijn.Context.Ext..>11-Mar-2016 15:44 65K 
[TXT]deBruijn.Context.Ext..>11-Mar-2016 15:44 226K 
[TXT]deBruijn.Context.Ext..>11-Mar-2016 15:44 227K 
[TXT]deBruijn.Context.Ter..>11-Mar-2016 15:44 302K 
[TXT]deBruijn.Context.html 11-Mar-2016 15:44 7.7K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 96K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 227K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 366K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 35K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 269K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 253K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 7.7K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 281K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 169K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 438K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 158K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 253K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 109K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 384K 
[TXT]deBruijn.Substitutio..>11-Mar-2016 15:44 96K 

README
------------------------------------------------------------------------
-- A library for working with dependently typed syntax
-- Nils Anders Danielsson
------------------------------------------------------------------------

-- This library is leaning heavily on two of Conor McBride's papers:
--
-- * Type-Preserving Renaming and Substitution.
--
-- * Outrageous but Meaningful Coincidences: Dependent type-safe
--   syntax and evaluation.

-- This module gives a brief overview of the modules in the library.

module README where

------------------------------------------------------------------------
-- The library

-- Contexts, variables, context morphisms, context extensions, etc.

import deBruijn.Context

-- Parallel substitutions (defined using an inductive family).

import deBruijn.Substitution.Data.Basics

-- A map function for the substitutions.

import deBruijn.Substitution.Data.Map

-- Some simple substitution combinators. (Given a term type which
-- supports weakening and transformation of variables to terms various
-- substitutions are defined and various lemmas proved.)

import deBruijn.Substitution.Data.Simple

-- Given an operation which applies a substitution to a term,
-- satisfying some properties, more operations and lemmas are
-- defined/proved.
--
-- (This module reexports various other modules.)

import deBruijn.Substitution.Data.Application

-- A module which repackages (and reexports) the development under
-- deBruijn.Substitution.Data.

import deBruijn.Substitution.Data

-- Some modules mirroring the development under
-- deBruijn.Substitution.Data, but using substitutions defined as
-- functions rather than data.
--
-- The functional version of substitutions is in some respects easier
-- to work with than the one based on data, but in other respects more
-- awkward. I maintain both developments so that they can be compared.

import deBruijn.Substitution.Function.Basics
import deBruijn.Substitution.Function.Map
import deBruijn.Substitution.Function.Simple

-- The two definitions of substitutions are isomorphic (assuming
-- extensionality).

import deBruijn.Substitution.Isomorphic

------------------------------------------------------------------------
-- An example showing how the library can be used

-- A well-typed representation of a dependently typed language.

import README.DependentlyTyped.Term

-- Normal and neutral terms.

import README.DependentlyTyped.NormalForm

-- Instantiation of deBruijn.Substitution.Data for terms.

import README.DependentlyTyped.Term.Substitution

-- Instantiation of deBruijn.Substitution.Data for normal and neutral
-- terms.

import README.DependentlyTyped.NormalForm.Substitution

-- Normalisation by evaluation.

import README.DependentlyTyped.NBE

-- Various equality checkers (some complete, all sound).

import README.DependentlyTyped.Equality-checker

-- Raw terms.

import README.DependentlyTyped.Raw-term

-- A type-checker (sound).

import README.DependentlyTyped.Type-checker

-- An observation: There is a term without a corresponding syntactic
-- type (given some assumptions).

import README.DependentlyTyped.Term-without-type

-- Another observation: If the "Outrageous but Meaningful
-- Coincidences" approach is used to formalise a language, then you
-- can end up with an extensional type theory (with equality
-- reflection).

import README.DependentlyTyped.Extensional-type-theory

-- Inductively defined beta-eta-equality.

import README.DependentlyTyped.Beta-Eta

-- TODO: Add an untyped example.