Types for Proofs and Programs

International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers

AvJean-Christophe Filliatre,Christine Paulin-Mohring

Häftad, Engelska, 2006

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

The 17 revised full papers presented here cover all current issues of formal reasoning and computer programming based on type theory are addressed; in particular languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education.

Produktinformation

Utgivningsdatum:2006-01-25
Mått:155 x 235 x undefined mm
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:280
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540314288

Utforska kategorier

Informationsteknik: allmänt inom Data och IT

Innehållsförteckning

Formalized Metatheory with Terms Represented by an Indexed Family of Types.- A Content Based Mathematical Search Engine: Whelp.- A Machine-Checked Formalization of the Random Oracle Model.- Extracting a Normalization Algorithm in Isabelle/HOL.- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis.- Formalising Bitonic Sort in Type Theory.- A Semi-reflexive Tactic for (Sub-)Equational Reasoning.- A Uniform and Certified Approach for Two Static Analyses.- Solving Two Problems in General Topology Via Types.- A Tool for Automated Theorem Proving in Agda.- Surreal Numbers in Coq.- A Few Constructions on Constructors.- Tactic-Based Optimized Compilation of Functional Programs.- Interfaces as Games, Programs as Strategies.- ?Z: Zermelo’s Set Theory as a PTS with 4 Sorts.- Exploring the Regular Tree Types.- On Constructive Existence.

Du kanske också är intresserad av

Types for Proofs and Programs

Benjamin Werner, Christine Paulin-Mohring, Jean-Christophe Filliatre

E-bok

2006

739 kr

Mathematics of Program Construction

Christine Paulin-Mohring, Philippe Audebaud

E-bok

2008

739 kr

Mission Impossible - Chances for a reform of the Security Council

Benjamin Werner

E-bok

2008

177 kr

Types for Proofs and Programs

Eduardo Gimenez, Christine Paulin-Mohring

Häftad, 1998

572 kr

Transnationale Unternehmen als Akteure in der Konfliktprävention. Corporate Social Responsibility-Strategien in den Konfliktzonen Nigeria und Sudan

Benjamin Werner

Häftad, 2016

907 kr

Interactive Theorem Proving

Sandrine Blazy, Christine Paulin-Mohring, David Pichardie

Häftad, 2013

572 kr

Interactive Theorem Proving

David Pichardie, Christine Paulin-Mohring, Sandrine Blazy

E-bok

2013

739 kr

Der silberne Schlüssel

Howard Phillips Lovecraft, Benjamin Werner

E-bok

2024

41 kr

Jäger der Finsternis

Howard Phillips Lovecraft, Benjamin Werner

E-bok

2023

28 kr

Mathematics of Program Construction

Philippe Audebaud, Christine Paulin-Mohring

Häftad, 2008

572 kr

Types for Proofs and Programs

International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers

AvJean-Christophe Filliatre,Christine Paulin-Mohring

Häftad, Engelska, 2006

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2006-01-25
Mått:155 x 235 x undefined mm
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:280
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540314288

Utforska kategorier

Informationsteknik: allmänt inom Data och IT

Innehållsförteckning

Formalized Metatheory with Terms Represented by an Indexed Family of Types.- A Content Based Mathematical Search Engine: Whelp.- A Machine-Checked Formalization of the Random Oracle Model.- Extracting a Normalization Algorithm in Isabelle/HOL.- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis.- Formalising Bitonic Sort in Type Theory.- A Semi-reflexive Tactic for (Sub-)Equational Reasoning.- A Uniform and Certified Approach for Two Static Analyses.- Solving Two Problems in General Topology Via Types.- A Tool for Automated Theorem Proving in Agda.- Surreal Numbers in Coq.- A Few Constructions on Constructors.- Tactic-Based Optimized Compilation of Functional Programs.- Interfaces as Games, Programs as Strategies.- ?Z: Zermelo’s Set Theory as a PTS with 4 Sorts.- Exploring the Regular Tree Types.- On Constructive Existence.