Lecture Notes in Computer Science - Types for Proofs and Programs
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540651376, 9783540495628

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Proving a real time algorithm for ATM in Coq

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097797 ◽

1998 ◽

pp. 277-293 ◽

Cited By ~ 5

Author(s):

Jean-François Monin

Keyword(s):

Real Time ◽

Time Algorithm

Download Full-text

Proof style

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097791 ◽

1998 ◽

pp. 154-172 ◽

Cited By ~ 12

Author(s):

John Harrison

Download Full-text

Inverting inductively defined relations in LEGO

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097795 ◽

1998 ◽

pp. 236-253 ◽

Cited By ~ 6

Author(s):

Conor McBride

Download Full-text

Introduction

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097783 ◽

1998 ◽

pp. 1-8

Download Full-text

Detecting and removing dead-code using rank 2 intersection

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097787 ◽

1998 ◽

pp. 66-87 ◽

Cited By ~ 4

Author(s):

Ferruccio Damiani ◽

Frédéric Prost

Keyword(s):

Dead Code ◽

Rank 2

Download Full-text

The internal type theory of a Heyting pretopos

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097794 ◽

1998 ◽

pp. 216-235 ◽

Cited By ~ 1

Author(s):

Maria Emilia Maietti

Keyword(s):

Type Theory

Download Full-text

Coercion synthesis in computer implementations of type-theoretic frameworks

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097784 ◽

1998 ◽

pp. 9-27 ◽

Cited By ~ 1

Author(s):

Anthony Bailey

Download Full-text

Continuous lattices in formal topology

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097800 ◽

1998 ◽

pp. 333-353

Author(s):

Sara Negri

Keyword(s):

Continuous Lattices ◽

Formal Topology

Download Full-text

A proof of weak termination of typed λσ-calculi

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097790 ◽

1998 ◽

pp. 134-153 ◽

Cited By ~ 3

Author(s):

Jean Goubault-Larrecq

Download Full-text

Verification of the interface of a small proof system in coq

Lecture Notes in Computer Science - Types for Proofs and Programs ◽

10.1007/bfb0097785 ◽

1998 ◽

pp. 28-45 ◽

Cited By ~ 3

Author(s):

Bruno Barras

Keyword(s):

Proof System

Download Full-text

Lecture Notes in Computer Science - Types for Proofs and ProgramsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Proving a real time algorithm for ATM in Coq

Proof style

Inverting inductively defined relations in LEGO

Introduction

Detecting and removing dead-code using rank 2 intersection

The internal type theory of a Heyting pretopos

Coercion synthesis in computer implementations of type-theoretic frameworks

Continuous lattices in formal topology

A proof of weak termination of typed λσ-calculi

Verification of the interface of a small proof system in coq

Lecture Notes in Computer Science - Types for Proofs and Programs
Latest Publications