2016 · 40 citations · 18 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesTheory Of ComputationData-flow AnalysisDeductive VerificationModel TransformationType CheckingType SystemsAgdaLambda CalculusLambda Calculus SemanticsType SafetyTyped Lambda Calculus
We abstract the common type-and-scope safe structure from computations on λ-terms that deliver, e.g., renaming, substitution, evaluation, CPS-transformation, and printing with a name supply. By exposing this structure, we can prove generic simulation and fusion lemmas relating operations built this way. This work has been fully formalised in Agda.
18
Notions of computation and monads
Eugenio Moggi · Information and Computation · 1991 · 1.7K citations
Types, Abstraction and Parametric Polymorphism.
John Reynolds · IFIP Congress · 1983 · 771 citations
Conor McBride, James McKinna · Journal of Functional Programming · 2004 · 327 citations · Full text
Dependently typed programming in Agda
Ulf Norell · 2009 · 289 citations