## Find a copy online

### Links to this item

proxy.library.carleton.ca Scholars Portal Books

Show all links

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books Conference papers and proceedings Congressen (vorm) Congresses |
---|---|

Additional Physical Format: | Print version: International Conference on Typed Lambda Calculi and Applications (1993 : Utrecht, Netherlands). Typed lambda calculi and applications. Berlin ; New York : Springer-Verlag, ©1993 (DLC) 93021883 (OCoLC)27641569 |

Material Type: | Conference publication, Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
M Bezem; J F Groote |

ISBN: | 9783540475866 3540475869 |

OCLC Number: | 321387686 |

Description: | 1 online resource (viii, 432 pages) : illustrations. |

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

Series Title: | Lecture notes in computer science, 664. |

Responsibility: | M. Bezem, J.F. Groote (eds.). |

### Abstract:

In the 1960s it wasdiscovered that the types of typed lambda calculi are infact appearances of logical propositions. Thus there are twopossible views of typed lambda calculi:- as models of computation, where terms are viewed asprograms in a typed programming language;
Read more...

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Typed lambda calculi and applications : International Conference on Typed Lam[b]da Calculi and Applications, TLCA '93, March 16-18, 1993, Utrecht, the Netherlands : proceedings".
Be the first.