skip to content
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 Preview this item
ClosePreview this item
Checking...

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

Author: M Bezem; J F Groote
Publisher: Berlin ; New York : Springer-Verlag, ©1993.
Series: Lecture notes in computer science, 664.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; 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:

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)  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/321387686> # 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
    a schema:Book, schema:MediaObject, schema:CreativeWork ;
    library:oclcnum "321387686" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://id.worldcat.org/fast/991011> ; # Lambda calculus
    schema:about <http://experiment.worldcat.org/entity/work/data/974927621#Topic/lambda_calculus> ; # Lambda-calculus
    schema:about <http://id.loc.gov/authorities/subjects/sh85074174> ; # Lambda calculus
    schema:about <http://dewey.info/class/511.3/e20/> ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/57288699> ; # Marc Bezem
    schema:contributor <http://viaf.org/viaf/4111973> ; # Jan Friso Groote
    schema:creator <http://experiment.worldcat.org/entity/work/data/974927621#Meeting/international_conference_on_typed_lambda_calculi_and_applications_1993_utrecht_netherlands> ; # International Conference on Typed Lambda Calculi and Applications (1993 : Utrecht, Netherlands)
    schema:datePublished "1993" ;
    schema:description "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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/974927621> ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:genre "Electronic books"@en ;
    schema:genre "Conference publication"@en ;
    schema:genre "Congressen (vorm)"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/27641569> ;
    schema:name "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"@en ;
    schema:productID "321387686" ;
    schema:url <http://dx.doi.org/10.1007/BFb0037093> ;
    schema:workExample <http://worldcat.org/isbn/9783540475866> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/321387686> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/974927621#Meeting/international_conference_on_typed_lambda_calculi_and_applications_1993_utrecht_netherlands> # International Conference on Typed Lambda Calculi and Applications (1993 : Utrecht, Netherlands)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/974927621#Place/utrecht_netherlands> ; # Utrecht, Netherlands)
    schema:name "International Conference on Typed Lambda Calculi and Applications (1993 : Utrecht, Netherlands)" ;
    .

<http://experiment.worldcat.org/entity/work/data/974927621#Place/utrecht_netherlands> # Utrecht, Netherlands)
    a schema:Place ;
    schema:name "Utrecht, Netherlands)" ;
    .

<http://id.loc.gov/authorities/subjects/sh85074174> # Lambda calculus
    a schema:Intangible ;
    schema:name "Lambda calculus"@en ;
    .

<http://id.worldcat.org/fast/991011> # Lambda calculus
    a schema:Intangible ;
    schema:name "Lambda calculus"@en ;
    .

<http://viaf.org/viaf/4111973> # Jan Friso Groote
    a schema:Person ;
    schema:birthDate "1965" ;
    schema:familyName "Groote" ;
    schema:givenName "Jan Friso" ;
    schema:givenName "J. F." ;
    schema:name "Jan Friso Groote" ;
    .

<http://viaf.org/viaf/57288699> # Marc Bezem
    a schema:Person ;
    schema:birthDate "1956" ;
    schema:familyName "Bezem" ;
    schema:givenName "Marc" ;
    schema:givenName "M." ;
    schema:name "Marc Bezem" ;
    .

<http://worldcat.org/isbn/9783540475866>
    a schema:ProductModel ;
    schema:isbn "3540475869" ;
    schema:isbn "9783540475866" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/321387686> ; # 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
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture notes in computer science," ;
    .

<http://www.worldcat.org/oclc/27641569>
    a schema:CreativeWork ;
    rdfs:label "Typed lambda calculi and applications." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/321387686> ; # 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
    .

<http://www.worldcat.org/title/-/oclc/321387686>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/321387686> ; # 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
    schema:dateModified "2016-06-28" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.