Del i serien Lecture Notes in Computer Science

Types for Proofs and Programs

International Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers

Häftad, Engelska, 1998

AvEduardo Gimenez,Christine Paulin-Mohring

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

This book constitutes the thoroughly revised post-workshop proceedings of the first annual workshop held under the auspices of the ESPRIT Working Group 21900 TYPES in Aussois, France in December 1996.The 18 revised full papers presented in the book were carefully reviewed and selected from the 30 papers accepted for presentation at the workshop. All current aspects of type theory and type systems and their applications to program verification and theorem proving are addressed; the proof systems and theorem provers dealt with include Coq, LEGO, and Isabelle/HOL.

Produktinformation

Utgivningsdatum1998-10-07
Mått155 x 235 x 21 mm
Vikt587 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor380
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540651376

Tillhör följande kategorier

Programmeringsböcker inom Data och IT

Coercion synthesis in computer implementations of type-theoretic frameworks.- Verification of the interface of a small proof system in coq.- An implementation of the Heine-Borel covering theorem in type theory.- Detecting and removing dead-code using rank 2 intersection.- A type-free formalization of mathematics where proofs are objects.- Higman's lemma in type theory.- A proof of weak termination of typed ??-calculi.- Proof style.- Some algorithmic and proof-theoretical aspects of coercive subtyping.- Semantical BNF.- The internal type theory of a Heyting pretopos.- Inverting inductively defined relations in LEGO.- A generic normalisation proof for pure type systems.- Proving a real time algorithm for ATM in Coq.- Dependent types with explicit substitutions: A meta-theoretical development.- Type inference verified: Algorithm W in Isabelle/HOL.- Continuous lattices in formal topology.- Abstract insertion sort in an extension of type theory with record types and subtyping.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Stefano Berardi, Mario Coppo, Ferruccio Damiani

Häftad, 2004

739 kr

Del i serien Lecture Notes in Computer Science

Types for Proofs and Programs

International Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers

Häftad, Engelska, 1998

AvEduardo Gimenez,Christine Paulin-Mohring

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1998-10-07
Mått155 x 235 x 21 mm
Vikt587 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor380
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540651376

Tillhör följande kategorier

Programmeringsböcker inom Data och IT

Coercion synthesis in computer implementations of type-theoretic frameworks.- Verification of the interface of a small proof system in coq.- An implementation of the Heine-Borel covering theorem in type theory.- Detecting and removing dead-code using rank 2 intersection.- A type-free formalization of mathematics where proofs are objects.- Higman's lemma in type theory.- A proof of weak termination of typed ??-calculi.- Proof style.- Some algorithmic and proof-theoretical aspects of coercive subtyping.- Semantical BNF.- The internal type theory of a Heyting pretopos.- Inverting inductively defined relations in LEGO.- A generic normalisation proof for pure type systems.- Proving a real time algorithm for ATM in Coq.- Dependent types with explicit substitutions: A meta-theoretical development.- Type inference verified: Algorithm W in Isabelle/HOL.- Continuous lattices in formal topology.- Abstract insertion sort in an extension of type theory with record types and subtyping.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Marino Miculan, Ivan Scagnetto, Furio Honsell

Häftad, 2008

739 kr