Proceedings of the workshop on Advances in linear logic
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Game Theoretic Analysis of Call-by-Value Computation
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Category Theory and Computer Science
A CPS-Transform of Constructive Classical Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Abstract Machines, Control, and Sequents
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A Proof Theoretical Account of Continuation Passing Style
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Parametric parameter passing λ-calculus
Information and Computation
Characterizing strong normalization in a language with control operators
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Investigations on the Dual Calculus
Theoretical Computer Science
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Categorical proof theory of classical propositional calculus
Theoretical Computer Science - Logic, language, information and computation
Combining algebraic effects with continuations
Theoretical Computer Science
On the Computational Representation of Classical Logical Connectives
Electronic Notes in Theoretical Computer Science (ENTCS)
Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Computation with classical sequents
Mathematical Structures in Computer Science
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Proofs, tests and continuation passing style
ACM Transactions on Computational Logic (TOCL)
Refinement types and computational duality
Proceedings of the 3rd workshop on Programming languages meets program verification
The Logic of Proofs as a Foundation for Certifying Mobile Computation
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Monadic Translation of Intuitionistic Sequent Calculus
Types for Proofs and Programs
Dual Calculus with Inductive and Coinductive Types
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
On the Values of Reducibility Candidates
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A Logically Saturated Extension of ${{\bar\lambda\mu\tilde{\mu}}}$
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
ACM Transactions on Computational Logic (TOCL)
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Declarative Representation of Proof Terms
Journal of Automated Reasoning
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Classical Natural Deduction for S4 Modal Logic
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Intersection and Union Types in the λμμ~-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Intersection and Union Types for X
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
Continuation semantics for the Lambek--Grishin calculus
Information and Computation
Parigot's second order λµ-calculus and inductive types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Continuation semantics for symmetric categorial grammar
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Symmetries in natural language syntax and semantics: the Lambek-Grishin calculus
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Completing Herbelin's programme
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Continuation-passing style and strong normalisation for intuitionistic sequent calculi
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
A substructural type system for delimited continuations
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Simple proofs of characterizing strong normalization for explicit substitution calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Call-by-value is dual to call-by-name, extended
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Strong normalisation of cut-elimination that simulates β-reduction
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Focalisation and classical realisability
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Towards a canonical classical natural deduction system
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A calculus of multiary sequent terms
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
The calculus of responsibility and commitment
Ludics, dialogue and interaction
Negative translations and duality: toward a unified approach
Ludics, dialogue and interaction
Covert movement in logical grammar
Logic and grammar
Classical call-by-need and duality
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
A filter model for the λµ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Intuitionistic sequent-style calculus with explicit structural rules
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A formal correspondence between OMDoc with alternative proofs and the λµµ-calculus
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
The language X: circuits, computations and classical logic
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Explanation in natural language of λμμ-Terms
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Arithmetical proofs of strong normalization results for the symmetric λµ-calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
λµ-calculus and duality: call-by-name and call-by-value
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
Subject reduction vs intersection / union types in λµµ
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A systematic approach to delimited control with multiple prompts
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Rewriting Computation and Proof
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Focusing and polarization in intuitionistic logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Proof Nets for Herbrand’s Theorem
ACM Transactions on Computational Logic (TOCL)
Copatterns: programming infinite structures by observations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The recursive polarized dual calculus
Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification
Semantic Types and Approximation for Featherweight Java
Theoretical Computer Science
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Characterising Strongly Normalising Intuitionistic Terms
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.01 |
We present the μ -calculus, a syntax for λ-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived from implicational Gentzen's sequent calculus LK, a key classical logical system in proof theory. Under the Curry-Howard correspondence between proofs and programs, we can see LK, or more precisely a formulation called LKμ , as a syntax-directed system of simple types for μ -calculus. For μ -calculus, choosing a call-by-name or call-by-value discipline for reduction amounts to choosing one of the two possible symmetric orientations of a critical pair. Our analysis leads us to revisit the question of what is a natural syntax for call-by-value functional computation. We define a translation of λμ-calculus into μ -calculus and two dual translations back to λ-calculus, and we recover known CPS translations by composing these translations.