Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Proofs and types
An abstract frame work for environment machines
Theoretical Computer Science
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
A calculus of mobile processes, I
Information and Computation
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
The geometry of interaction machine
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Static prediction of heap space usage for first-order functional programs
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
The Girard Translation Extended with Recursion
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The differential Lambda-calculus
Theoretical Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
The Geometry of Linear Higher-Order Recursion
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Geometry of synthesis: a structured approach to VLSI design
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weak linearization of the lambda calculus
Theoretical Computer Science - Applied semantics: Selected topics
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
New Developments in Environment Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Enriching an effect calculus with linear types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A linear account of session types in the pi calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Rewriting Computation and Proof
| Hi-index | 0.00 |
We show that the full PCF language can be encoded in L_rec, a syntactically linear λ-calculus extended with numbers, pairs, and an unbounded recursor that preserves the syntactic linearity of the calculus. We give call-by-name and call-by-value evaluation strategies and discuss implementation techniques for L_rec, exploiting its linearity.