Publication | Closed Access
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
78
Citations
11
References
2004
Year
Unknown Venue
Normal FormsExtensional NormalisationAlgebraic LogicEngineeringGeneric ProgrammingAutomated ReasoningType TheoryType-directed Partial EvaluationDependently Typed ProgrammingFormal MethodsComputer ScienceType SystemHigher-order LogicLambda CalculusNormal FormTyped Lambda Calculus
We present a notion of η-long β-normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in normal form. Based on this development we give the first type-directed partial evaluator that constructs %able to construct normal forms of terms in this calculus.
| Year | Citations | |
|---|---|---|
Page 1
Page 1