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...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Yhteisötekijä: International Conference on Typed Lambda Calculi and Applications :Utrech
Muut tekijät: Groote, Jan Frisco (Päätoimittaja), Bezem, Marc, 1956- (Päätoimittaja)
Aineistotyyppi: Livre numérique
Kieli:Anglais
Julkaistu: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Sarja:Lecture notes in computer science 664
Aiheet:
Linkit:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Huomautus: 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
LEADER 05250nam a22004217a 4500
001 945395
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155225944
020 |a 9783540475866 (PDF) 
041 0 |a eng 
082 |a 511.3 
082 |a 004 
111 2 |a International Conference on Typed Lambda Calculi and Applications  |n (01  |d  :1993  |c  :Utrech). 
245 1 0 |a Typed lambda calculi and applications :  |b [first] International Conference on Typed Lambda Calculi and Applications TLCA '93 March, 16 18, 1993, Utrech, The Netherlands : proceedings   |c [edited by] M. Bezem. J.F. Groote. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 664  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 languages. In typed lambda calculi, lambda terms are classified according to their applicative behavior. In the 1960s it was discovered that the types of typed lambda calculi are in fact appearances of logical propositions. Thus there are two possible views of typed lambda calculi: - as models of computation, where terms are viewed as programs in a typed programming language; - as logical theories, where the types are viewed as propositions and the terms as proofs. The practical spin-off from these studies are: - functional programming languages which are mathematically more succinct than imperative programs; - systems for automated proof checking based on lambda caluli. This volume is the proceedings of TLCA '93, the first international conference on Typed Lambda Calculi and Applications,organized by the Department of Philosophy of Utrecht University. It includes29 papers selected from 51 submissions. 
650 |a Informatique 
650 |a Lambda-calcul 
650 |a Ordinateurs 
650 |a Logique symbolique et mathématique 
650 |a Actes de congrès 
700 1 |a Groote, Jan Frisco.  |4 pbd 
700 1 |a Bezem, Marc,  |d 1956-  |4 pbd 
776 0 |0 016558243  |t Typed lambda calculi and applications  |f M. Bezem. J.F. Groote, eds  |c Berlin  |n Springer-Verlag  |d 1993  |p 1 vol. (VIII-432 p.)  |s Lecture notes in computer science  |z 0-387-56517-5 
776 0 |t Typed Lambda Calculi and Applications  |b Texte imprimé  |z 9783662164143 
856 4 |q PDF  |u https://doi.org/10.1007/BFb0037093  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-P5LKFH8Q-G  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747910871  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0037093  |z Accès Université d'Orléans 
856 4 |5 180339901:75092375X  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0037093  |z Accès INSA CVL 
997 |0 945395  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/