Context information for lazy code generation
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Incremental reduction in the lambda calculus
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A representation of Lambda terms suitable for operations on their intensions
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compilation of functional languages by program transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Staging transformations for abstract machines
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Unboxed objects and polymorphic typing
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A concurrent, generational garbage collector for a multithreaded implementation of ML
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational semantics-directed compilers and machine architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unboxed values and polymorphic typing revisited
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
An Unboxed Operational Semantics for ML Polymorphism
Lisp and Symbolic Computation
A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Run-time code generation and modal-ML
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Mixin Modules in a Call-by-Value Setting
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Categorical Models of Explicit Substitutions
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Call-by-Value lambda-Graph Rewriting Without Rewriting
ICGT '02 Proceedings of the First International Conference on Graph Transformation
On extracting static semantics
The essence of computation
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Compilation of extended recursion in call-by-value functional languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
iRho: an imperative rewriting calculus
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A treatment of higher-order features in logic programming
Theory and Practice of Logic Programming
Mixin modules in a call-by-value setting
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM SIGACT News
Formal compiler construction in a logical framework
Higher-Order and Symbolic Computation
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
A proof theory for machine code
ACM Transactions on Programming Languages and Systems (TOPLAS)
State-transition machines, revisited
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Irho: An imperative rewriting calculus
Mathematical Structures in Computer Science
Inter-deriving Semantic Artifacts for Object-Oriented Programming
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Coinductive big-step operational semantics
Information and Computation
New Developments in Environment Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Compilation of extended recursion in call-by-value functional languages
Higher-Order and Symbolic Computation
A verified framework for higher-order uncurrying optimizations
Higher-Order and Symbolic Computation
Deriving compilers and virtual machines for a multi-level language
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Optimizing structural recursion in functional programs
Computer Languages
| Hi-index | 0.00 |