Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Compiling with continuations
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
A natural semantics for lazy evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I
Information and Computation
Optimal reduction in weak-&lgr;-calculus with shared environments
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Lisp and Symbolic Computation - Special issue on continuations—part I
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Polymorphic type assignment and CPS conversion
Lisp and Symbolic Computation - Special issue on continuations—part I
A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The structure of continuation-passing styles
The structure of continuation-passing styles
Functional computation as concurrent computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of programming languages
Foundations of programming languages
The π-calculus in direct style
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Basic simple type theory
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
An interpretation of typed objects into typed &pgr;-calculus
Information and Computation
Asynchronous process calculi: the first-and higher-order paradigms
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Actor induction and meta-evaluation
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
A Theory of Objects
Essentials of Programming Languages
Essentials of Programming Languages
An Adequate Operational Semantics for Sharing in Lazy Evaluation
ESOP '92 Proceedings of the 4th European Symposium on Programming
The Problem of Overgeneration in Parsing Processes and the Aid of Linguistic Generalizations
4. Österreichische Artificial-Intelligence-Tagung, Wiener Workshop Wissensbasierte Sprachverarbeitung
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Process Semantics of Graph Reduction
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Some Chemical Abstract Machines
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Towards a Lambda-Calculus for Concurrent and Communicating Systems
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Proceedings of ACM conference on Proving assertions about programs
Journal of Functional Programming
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
| Hi-index | 0.00 |
We study the relationship between the encodings of the λ-calculus into π-calculus, the Continuation Passing Style (CPS) transforms, and the compilation of the Higher-Order π-calculus (HOπ) into π-calculus. We factorise the π-calculus encodings of (untyped as well as simply-typed) call-by-name and call-by-value λ-calculus into three steps: a CPS transform, the inclusion of CPS terms into HOπ and the compilation from HOπ to π-calculus. The factorisations are used both to derive the encodings and to prove their correctness.