Typed Lambda Calculi and Applications (Record no. 35413)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04775nam a22005295i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783540475866 |
| -- | 978-3-540-47586-6 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.131 |
| 245 10 - TITLE STATEMENT | |
| Title | Typed Lambda Calculi and Applications |
| Sub Title | International Conference on Typed Lambda Calculi and Applications TLCA '93 March, 16–18, 1993, Utrech, The Netherlands Proceedings / |
| Statement of responsibility, etc | edited by Marc Bezem, Jan Friso Groote. |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Berlin, Heidelberg : |
| Name of publisher | Springer Berlin Heidelberg, |
| Year of publication | 1993. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | IX, 443 p. |
| Other physical details | online resource. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Logic design. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Logic, Symbolic and mathematical. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Logics and Meanings of Programs. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Programming Techniques. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical Logic and Foundations. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Bezem, Marc. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Groote, Jan Friso. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/BFb0037093 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E-BOOKS |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 1993. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
|---|---|---|---|---|---|---|---|
| IMSc Library | EBK6119 | http://dx.doi.org/10.1007/BFb0037093 | E-BOOKS |