Theoretical Computer Science
Continuation-passing, closure-passing style
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
On the Computational Representation of Classical Logical Connectives
Electronic Notes in Theoretical Computer Science (ENTCS)
Computation with classical sequents
Mathematical Structures in Computer Science
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Approaches to polymorphism in classical sequent calculus
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Rewriting Computation and Proof
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
We present the syntax and reduction rules for χ, an untyped language that is well suited to describe structures which we call “circuits” and which are made of parts that are connected by wires. To demonstrate that χ gives an expressive platform, we will show how, even in an untyped setting, that we can faithfully embed algebraic objects and elaborate calculi, like the naturals, the λ-calculus, Bloe and Rose’s calculus of explicit substitutions λx, and Parigot’s λμ.