Introduction to higher order categorical logic
Introduction to higher order categorical logic
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A generalization of exceptions and control in ML-like languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Type-directed partial evaluation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Memoization in Type-Directed Partial Evaluation
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation
TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Some Lambda Calculi with Categorial Sums and Products
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Equality Between Functionals in the Presence of Coproducts
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Normalization by Evaluation for Typed Lambda Calculus with Coproducts
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A short survey of isomorphisms of types
Mathematical Structures in Computer Science
On the static and dynamic extents of delimited continuations
Science of Computer Programming
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A static simulation of dynamic delimited control
Higher-Order and Symbolic Computation
Closing the stage: from staged code to typed closures
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A Characterisation of Lambda Definability with Sums Via T T-Closure Operators
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
Journal of Functional Programming
A substructural type system for delimited continuations
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Extensional rewriting with sums
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Finally tagless, partially evaluated: tagless staged interpreters for simpler typed languages
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
On normalization by evaluation for object calculi
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Typed applicative structures and normalization by evaluation for system Fω
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Shifting the stage: Staging with delimited control
Journal of Functional Programming
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Delimited control in OCaml, abstractly and concretely: system description
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Theoretical Computer Science
Delimited control in OCaml, abstractly and concretely
Theoretical Computer Science
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Extending Type Inference to Variational Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formalizing a correctness property of a type-directed partial evaluator
Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification
Normalization by Evaluation and Algebraic Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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.