My Account Log in

1 option

Types for Proofs and Programs : International Workshop, TYPES'99, Lökeberg, Sweden, June 12-16, 1999, Selected Papers / edited by Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan Smith.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Coquand, Thierry, 1961- editor.
Dybjer, Peter, editor.
Nordström, Bengt, editor.
Smith, Jan, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1956.
Lecture Notes in Computer Science, 0302-9743 ; 1956
Language:
English
Subjects (All):
Programming languages (Electronic computers).
Computer logic.
Logic, Symbolic and mathematical.
Artificial intelligence.
Programming Languages, Compilers, Interpreters.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Mathematical Logic and Foundations.
Local Subjects:
Programming Languages, Compilers, Interpreters.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Mathematical Logic and Foundations.
Physical Description:
1 online resource (VIII, 197 pages).
Edition:
First edition 2000.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
System Details:
text file PDF
Contents:
Specification and Verification of a Formal System for Structurally Recursive Functions
A Predicative Strong Normalisation Proof for a ?Calculus with Interleaving Inductive Types
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and ?-Rule
Computer-Assisted Mathematics at Work
Specification of a Smart Card Operating System
Implementation Techniques for Inductive Types in Plastic
A Co-inductive Approach to Real Numbers
Information Retrieval in a Coq Proof Library Using Type Isomorphisms
Memory Management: An Abstract Formulation of Incremental Tracing
The Three Gap Theorem (Steinhaus Conjecture)
Formalising Formulas-as-Types-as-Objects.
Other Format:
Printed edition:
ISBN:
978-3-540-44557-9
9783540445579
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account