Typed lambda calculi and applications : [first] International Conference on Typed Lambda Calculi and Applications TLCA '93 March, 16 18, 1993, Utrech, The Netherlands : proceedings
The lambda calculus was developed in the 1930s by Alonzo Church. The calculus turned out to be an interesting model of computation and became theprototype for untyped functional programming languages. Operational and denotational semantics for the calculus served as examples for otherprogramming lan...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
664 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Typed lambda calculi and applications, M. Bezem. J.F. Groote, eds, Berlin, Springer-Verlag, 1993, 1 vol. (VIII-432 p.), Lecture notes in computer science, 0-387-56517-5 • Typed Lambda Calculi and Applications, Texte imprimé, 9783662164143 |
Obsah:
- On Mints' reduction for ccc-calculus
- A formalization of the strong normalization proof for System F in LEGO
- Partial intersection type assignment in applicative term rewriting systems
- Extracting constructive content from classical logic via control-like reductions
- Combining first and higher order rewrite systems with type assignment systems
- A term calculus for Intuitionistic Linear Logic
- Program extraction from normalization proofs
- A semantics for ? &-early: a calculus with overloading and early binding
- An abstract notion of application
- The undecidability of typability in the Lambda-Pi-calculus
- Recursive types are not conservative over F?
- The conservation theorem revisited
- Modified realizability toposes and strong normalization proofs
- Semantics of lambda-I and of other substructure lambda calculi
- Translating dependent type theory into higher order logic
- Studying the fully abstract model of PCF within its continuous function model
- A new characterization of lambda definability
- Combining recursive and dynamic types
- Lambda calculus characterizations of poly-time
- Pure type systems formalized
- Orthogonal higher-order rewrite systems are confluent
- Monotonic versus antimonotonic exponentiation
- Inductive definitions in the system Coq rules and properties
- Intersection types and bounded polymorphism
- A logic for parametric polymorphism
- Call-by-value and nondeterminism
- Lower and upper bounds for reductions of types in ? and ?P (extended abstract)
- ?-Calculi with conditional rules
- Type reconstruction in F? is undecidable.