PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Calling hell from heaven and heaven from hell
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Domain specific embedded compilers
Proceedings of the 2nd conference on Domain-specific languages
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
A Semantic Account of Type-Directed Partial Evaluation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Program Extraction from Normalization Proofs
TLCA '93 Proceedings of the 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
Categorical Reconstruction of a Reduction Free Normalization Proof
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Reduction-free normalisation for a polymorphic system
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Normalization and the Yoneda embedding
Mathematical Structures in Computer Science
Intuitionistic model constructions and normalization proofs
Mathematical Structures in Computer Science
A foundation for embedded languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Memoization in Type-Directed Partial Evaluation
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
A symmetric approach to compilation and decompilation
The essence of computation
Obsessional experiments for linear logic proof-nets
Mathematical Structures in Computer Science
Operational aspects of untyped Normalisation by Evaluation
Mathematical Structures in Computer Science
Implementing Typeful Program Transformations
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
A Compiled Implementation of Normalization by Evaluation
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Simple types in type theory: deep and shallow encodings
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Implementing Typeful Program Transformations
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
| Hi-index | 0.00 |
In higher-order abstract syntax, the variables and bindings of an object language are represented by variables and bindings of a meta-language. Let us consider the simply typed λ-calculus as object language and Haskell as meta-language. For concreteness, we also throw in integers and addition, but only in this section.