Typed Lambda Calculi and Applications: International Conference on Typed Lambda Calculi and Applications, Tlca '93, March 16-18, 1993, Utrecht, the Netherlands. Proceedings (International Conference Proceedings on Typed Lambda Calculi and Applications, Tc - Marc Bezem - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540565178 - 1993. gada 3. marts
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Marc Bezem
Typed Lambda Calculi and Applications: International Conference on Typed Lambda Calculi and Applications, Tlca '93, March 16-18, 1993, Utrecht, the Netherlands. Proceedings (International Conference Proceedings on Typed Lambda Calculi and Applications, Tc

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 12. - 20. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Marc Bezem izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

This volume of conference proceedings contains 29 research papers on typed lambda calculi, which are used as models of computation (where terms are viewed as programs in a typed programming language) and as logical theories (where types are viewed as propositions and terms as proofs).

Marc Notes: Includes bibliographical references and index. Table of Contents: 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. Publisher Marketing: This volume of conference proceedings contains 29 research papers on typed lambda calculi, which are used as models of computation (where terms are viewed as programs in a typed programming language) and as logical theories (where types are viewed as propositions and terms as proofs).

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 1993. gada 3. marts
ISBN13 9783540565178
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 452
Izmēri 156 × 234 × 23 mm   ·   635 g
Valoda Vācu  
Redaktors Bezem, Marc
Redaktors Groote, Jan F.

Vairāk no tā paša izdevēja

Skatīt visus Marc Bezem