rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Types for Proofs and Programs
    sub title: International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers
  name:
    name part: Callaghan, Paul.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Luo, Zhaohui.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: McKinna, James.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Pollack, Robert.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2002
    edition: 1st ed. 2002.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VIII, 248 p. online resource.
  table of contents: Collection Principles in Dependent Type Theory -- Executing Higher Order Logic -- A Tour with Constructive Real Numbers -- An Implementation of Type:Type -- On the Logical Content of Computational Type Theory: A Solution to Curry's Problem -- Constructive Reals in Coq: Axioms and Categoricity -- A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals -- A Kripke-Style Model for the Admissibility of Structural Rules -- Towards Limit Computable Mathematics -- Formalizing the Halting Problem in a Constructive Type Theory -- On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory -- Changing Data Structures in Type Theory: A Study of Natural Numbers -- Elimination with a Motive -- Generalization in Type Theory Based Proof Assistants -- An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma.
  note: edited by Paul Callaghan, Zhaohui Luo, James McKinna, Robert Pollack.
  subject:
    topic: Computer logic
  subject:
    topic: Architecture, Computer
  subject:
    topic: Mathematical logic
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Artificial intelligence
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Computer System Implementation
  subject:
    topic: Mathematical Logic and Foundations
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Artificial Intelligence
  classification: QA76.9.L63
  classification: QA76.5913
  classification: 005.1015113
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2277
  identifier: 9783540458425
  identifier: https://doi.org/10.1007/3-540-45842-5
  record info:
    record creation date: 121227
    record change date: 20191027132231.0
    record identifier: 978-3-540-45842-5