LEADER 05005nam  22006855  450 
001 996466100403316
005 20200703043701.0
010   $a3-540-49178-3
024 7 $a10.1007/BFb0014040
035   $a(CKB)1000000000234244
035   $a(SSID)ssj0000327455
035   $a(PQKBManifestationID)11244060
035   $a(PQKBTitleCode)TC0000327455
035   $a(PQKBWorkID)10301771
035   $a(PQKB)11549933
035   $a(DE-He213)978-3-540-49178-1
035   $a(PPN)155171208
035   $a(EXLCZ)991000000000234244
100   $a20121227d1995      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTyped Lambda Calculi and Applications$b[electronic resource] $eSecond International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings /$fedited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin
205   $a1st ed. 1995.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995.
215   $a1 online resource (VIII, 452 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v902
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-59048-X 
327   $aComparing ?-calculus translations in sharing graphs -- Extensions of pure type systems -- A model for formal parametric polymorphism: A per interpretation for system R -- A realization of the negative interpretation of the Axiom of Choice -- Using subtyping in program optimization -- What is a categorical model of Intuitionistic Linear Logic? -- An explicit Eta rewrite rule -- Extracting text from proofs -- Higher-order abstract syntax in Coq -- Expanding extensional polymorphism -- Lambda-calculus, combinators and the comprehension scheme -- ??-Equality for coproducts -- Typed operational semantics -- A simple calculus of exception handling -- A simple model for quotient types -- Untyped ?-calculus with relative typing -- Final semantics for untyped ?-calculus -- A simplification of Girard's paradox -- Basic properties of data types with inequational refinements -- Decidable properties of intersection type systems -- Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq -- Typed ?-calculi with explicit substitutions may not terminate -- On equivalence classes of interpolation equations -- Strict functionals for termination proofs -- A verified typechecker -- Categorical semantics of the call-by-value ?-calculus -- A fully abstract translation between a ?-calculus with reference types and Standard ML -- Categorical completeness results for the simply-typed lambda-calculus -- Third-order matching in the presence of type constructors.
330   $aThis volume presents the proceedings of the Second International Conference on Typed Lambda Calculi and Applications, held in Edinburgh, UK in April 1995. The book contains 29 full revised papers selected from 58 submissions and comprehensively reports the state of the art in the field. The following topics are addressed: proof theory of type systems, logic and type systems, typed lambda calculi as models of (higher-order) computation, semantics of type systems, proof verification via type systems, type systems of programming languages, and typed term rewriting systems.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v902
606   $aComputers
606   $aMathematical logic
606   $aComputer logic
606   $aComputer programming
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
615  0$aComputers.
615  0$aMathematical logic.
615  0$aComputer logic.
615  0$aComputer programming.
615 14$aTheory of Computation.
615 24$aMathematical Logic and Foundations.
615 24$aMathematical Logic and Formal Languages.
615 24$aLogics and Meanings of Programs.
615 24$aProgramming Techniques.
676   $a511.3
702   $aDezani-Ciancaglini$b Mariangiola$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPlotkin$b Gordon$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aInternational Conference on Typed Lambda Calculi and Applications
906   $aBOOK
912   $a996466100403316
996   $aTyped Lambda Calculi and Applications$9772124
997   $aUNISA