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

[ICO]NameLast modifiedSizeDescription

[DIR]Parent Directory   -  
[TXT]Agda.Builtin.Bool.html 12-Jul-2018 14:22 2.4K 
[TXT]Agda.Builtin.Equalit..>12-Jul-2018 14:22 2.3K 
[TXT]Agda.Builtin.Nat.html 12-Jul-2018 14:22 18K 
[TXT]Agda.Builtin.Sigma.html12-Jul-2018 14:22 2.7K 
[TXT]Agda.Builtin.Strict...>12-Jul-2018 14:22 4.5K 
[TXT]Agda.Builtin.TrustMe..>12-Jul-2018 14:22 1.8K 
[TXT]Agda.Builtin.Unit.html 12-Jul-2018 14:22 1.2K 
[TXT]Agda.Primitive.html 12-Jul-2018 14:22 3.6K 
[TXT]Agda.css 12-Jul-2018 14:22 1.2K 
[TXT]Category.Applicative..>12-Jul-2018 14:22 36K 
[TXT]Category.Functor.html 12-Jul-2018 14:22 9.2K 
[TXT]Category.Monad.Ident..>12-Jul-2018 14:22 3.3K 
[TXT]Category.Monad.Index..>12-Jul-2018 14:22 27K 
[TXT]Category.Monad.html 12-Jul-2018 14:22 9.2K 
[TXT]Data.Bool.Base.html 12-Jul-2018 14:22 12K 
[TXT]Data.Empty.Irrelevan..>12-Jul-2018 14:22 1.9K 
[TXT]Data.Empty.html 12-Jul-2018 14:22 2.2K 
[TXT]Data.Maybe.Base.html 12-Jul-2018 14:22 35K 
[TXT]Data.Maybe.html 12-Jul-2018 14:22 45K 
[TXT]Data.Nat.Base.html 12-Jul-2018 14:22 54K 
[TXT]Data.Nat.html 12-Jul-2018 14:22 929  
[TXT]Data.Product.html 12-Jul-2018 14:22 62K 
[TXT]Data.Sum.Base.html 12-Jul-2018 14:22 20K 
[TXT]Data.Sum.html 12-Jul-2018 14:22 15K 
[TXT]Data.Unit.Base.html 12-Jul-2018 14:22 1.9K 
[TXT]Data.Unit.html 12-Jul-2018 14:22 11K 
[TXT]Function.Bijection.html12-Jul-2018 14:22 23K 
[TXT]Function.Equality.html 12-Jul-2018 14:22 37K 
[TXT]Function.Equivalence..>12-Jul-2018 14:22 37K 
[TXT]Function.Injection.html12-Jul-2018 14:22 17K 
[TXT]Function.Inverse.html 12-Jul-2018 14:22 51K 
[TXT]Function.LeftInverse..>12-Jul-2018 14:22 36K 
[TXT]Function.Surjection...>12-Jul-2018 14:22 26K 
[TXT]Function.html 12-Jul-2018 14:22 47K 
[TXT]Level.html 12-Jul-2018 14:22 3.0K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 53K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 75K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 39K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 158K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 76K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 121K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 58K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 45K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 31K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 20K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 148K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 136K 
[TXT]README.DependentlyTy..>12-Jul-2018 14:22 81K 
[TXT]README.html 12-Jul-2018 14:22 7.7K 
[TXT]Relation.Binary.Cons..>12-Jul-2018 14:22 60K 
[TXT]Relation.Binary.Core..>12-Jul-2018 14:22 81K 
[TXT]Relation.Binary.EqRe..>12-Jul-2018 14:22 3.2K 
[TXT]Relation.Binary.Hete..>12-Jul-2018 14:22 5.8K 
[TXT]Relation.Binary.Inde..>12-Jul-2018 14:22 23K 
[TXT]Relation.Binary.Inde..>12-Jul-2018 14:22 8.5K 
[TXT]Relation.Binary.Preo..>12-Jul-2018 14:22 17K 
[TXT]Relation.Binary.Prop..>12-Jul-2018 14:22 10K 
[TXT]Relation.Binary.Prop..>12-Jul-2018 14:22 10K 
[TXT]Relation.Binary.Prop..>12-Jul-2018 14:22 86K 
[TXT]Relation.Binary.html 12-Jul-2018 14:22 97K 
[TXT]Relation.Nullary.Dec..>12-Jul-2018 14:22 38K 
[TXT]Relation.Nullary.Pro..>12-Jul-2018 14:22 5.3K 
[TXT]Relation.Nullary.html 12-Jul-2018 14:22 6.5K 
[TXT]Relation.Unary.html 12-Jul-2018 14:22 88K 
[TXT]Strict.html 12-Jul-2018 14:22 6.7K 
[TXT]Universe.html 12-Jul-2018 14:22 6.1K 
[TXT]deBruijn.Context.Bas..>12-Jul-2018 14:22 199K 
[TXT]deBruijn.Context.Ext..>12-Jul-2018 14:22 39K 
[TXT]deBruijn.Context.Ext..>12-Jul-2018 14:22 137K 
[TXT]deBruijn.Context.Ext..>12-Jul-2018 14:22 139K 
[TXT]deBruijn.Context.Ter..>12-Jul-2018 14:22 177K 
[TXT]deBruijn.Context.html 12-Jul-2018 14:22 4.2K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 60K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 147K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 236K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 21K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 175K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 163K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 4.5K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 170K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 103K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 271K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 93K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 154K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 66K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 239K 
[TXT]deBruijn.Substitutio..>12-Jul-2018 14:22 58K 

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.