Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage

Authors:
Daniel J. Dougherty;Silvia Ghilezan;Pierre Lescanne
Affiliations:
Worcester Polytechnic Institute, Worcester, MA 101609, USA;Faculty of Engineering, University of Novi Sad, Novi Sad, Serbia;École Normale Supérieure de Lyon, Lyon, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 23
Cited 6

A formulae-as-type notion of control

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection and union types: syntax and semantics

Information and Computation
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A symmetric lambda calculus for classical program extraction

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
The duality of computation

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Branching Types

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Une Extension de la Theorie des Types en lambda-Calcul

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Call-by-value is dual to call-by-name

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Tridirectional typechecking

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda terms for natural deduction, sequent calculus and cut elimination

Journal of Functional Programming
A calculus with polymorphic and polyvariant flow types

Journal of Functional Programming
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
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
On strong normalization and type inference in the intersection type discipline

Theoretical Computer Science
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Intersection and Union Types in the λμμ~-calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Type assignment for intersections and unions in call-by-value languages

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Strong normalization of the dual classical sequent calculus

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Call-by-value is dual to call-by-name: reloaded

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Characterising strongly normalising intuitionistic sequent terms

TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
A filter model for the λµ-calculus

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Intersection types for the resource control lambda calculi

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Subject reduction vs intersection / union types in λµµ

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

We develop an intersection type system for the @l@?@m@m@? calculus of Curien and Herbelin. This calculus provides a symmetric computational interpretation of classical sequent style logic and gives a simple account of call-by-name and call-by-value. The present system improves upon earlier type disciplines for @l@?@m@m@?: in addition to characterizing the @l@?@m@m@? expressions that are strongly normalizing under free (unrestricted) reduction, the system enjoys the Subject Reduction and the Subject Expansion properties.