Types for Proofs and Programs Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Geuvers, Herman (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Wiedijk, Freek (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2646
• Θέματα: Software engineering.; Computers.; Computer logic.; Programming languages (Electronic computers).; Mathematical logic.; Software Engineering/Programming and Operating Systems.; Science, Humanities and Social Sciences, multidisciplinary.; Theory of Computation.; Logics and Meanings of Programs.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.

These proceedings contain a refereed selection of papers presented at the Second Annual Workshop of the Types Working Group (Computer-Assisted Reasoning based on Type Theory, EUIST project 29001), which was held April 24-28, 2002 in Hotel Erica, Berg en Dal (close to Nijmegen), The Netherlands. The...

Πίνακας περιεχομένων:

• (Co-)Iteration for Higher-Order Nested Datatypes
• Program Extraction in Simply-Typed Higher Order Logic
• General Recursion in Type Theory
• Using Theory Morphisms for Implementing Formal Methods Tools
• Subsets, Quotients and Partial Functions in Martin-Löf's Type Theory
• Mathematical Quotients and Quotient Types in Coq
• A Constructive Formalization of the Fundamental Theorem of Calculus
• Two Behavioural Lambda Models
• A Unifying Approach to Recursive and Co-recursive Definitions
• Holes with Binding Power
• Typing with Conditions and Guarantees for Functional In-place Update
• A New Extraction for Coq
• Weak Transitivity in Coercive Subtyping
• The Not So Simple Proof-Irrelevant Model of CC
• Structured Proofs in Isar/HOL
• Java as a Functional Programming Language
• Monad Translating Inductive and Coinductive Types
• A Finite First-Order Presentation of Set Theory.