Coverart for item
The Resource Typed Lambda Calculi and Applications : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95 Edinburgh, United Kingdom, April 10-12, 1995 Proceedings, edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin

Typed Lambda Calculi and Applications : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95 Edinburgh, United Kingdom, April 10-12, 1995 Proceedings, edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin

Label
Typed Lambda Calculi and Applications : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95 Edinburgh, United Kingdom, April 10-12, 1995 Proceedings
Title
Typed Lambda Calculi and Applications
Title remainder
Second International Conference on Typed Lambda Calculi and Applications, TLCA '95 Edinburgh, United Kingdom, April 10-12, 1995 Proceedings
Statement of responsibility
edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin
Creator
Contributor
Subject
Genre
Language
eng
Summary
This 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
Member of
Cataloging source
KIJ
Dewey number
511.3
Image bit depth
0
Index
index present
Language note
English
LC call number
QA9.5
LC item number
.I58 1995
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1995
http://bibfra.me/vocab/lite/meetingName
International Conference on Typed Lambda Calculi and Applications
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1946-
http://library.link/vocab/relatedWorkOrContributorName
  • Plotkin, G.
  • Dezani-Ciancaglini, M.
Series statement
Lecture Notes in Computer Science,
Series volume
902
http://library.link/vocab/subjectName
  • Lambda calculus
  • Computer science
  • Logic design
  • Logic, Symbolic and mathematical
  • Computer science
  • Lambda calculus
  • Logic design
  • Logic, Symbolic and mathematical
  • Lambda-calculus
  • Mathematical Theory
  • Mathematics
  • Physical Sciences & Mathematics
Label
Typed Lambda Calculi and Applications : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95 Edinburgh, United Kingdom, April 10-12, 1995 Proceedings, edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin
Instantiates
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Comparing?-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
Control code
827360023
Dimensions
unknown
Extent
1 online resource
File format
multiple file formats
Form of item
online
Isbn
9780387590486
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/BFb0014040
Other physical details
volumes: digital.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827360023
Label
Typed Lambda Calculi and Applications : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95 Edinburgh, United Kingdom, April 10-12, 1995 Proceedings, edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Comparing?-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
Control code
827360023
Dimensions
unknown
Extent
1 online resource
File format
multiple file formats
Form of item
online
Isbn
9780387590486
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/BFb0014040
Other physical details
volumes: digital.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827360023

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...