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

9783540744634, 9783540744641

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs

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

10.1007/978-3-540-74464-1_15 ◽

2007 ◽

pp. 221-236 ◽

Cited By ~ 1

Author(s):

Hugo R. Simões ◽

Kevin Hammond ◽

Mário Florido ◽

Pedro Vasconcelos

Keyword(s):

Cost Analysis ◽

Higher Order ◽

Intersection Types

Download Full-text

Zermelo’s Well-Ordering Theorem in Type Theory

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

10.1007/978-3-540-74464-1_12 ◽

2007 ◽

pp. 175-187 ◽

Cited By ~ 1

Author(s):

Danko Ilik

Keyword(s):

Type Theory

Download Full-text

Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory

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

10.1007/978-3-540-74464-1_1 ◽

2007 ◽

pp. 1-17 ◽

Cited By ~ 1

Author(s):

Robin Adams ◽

Zhaohui Luo

Keyword(s):

Type Theory ◽

Classical Mathematics

Download Full-text

A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family

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

10.1007/978-3-540-74464-1_7 ◽

2007 ◽

pp. 93-109 ◽

Cited By ~ 12

Author(s):

Nils Anders Danielsson

Download Full-text

A Finite First-Order Theory of Classes

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

10.1007/978-3-540-74464-1_13 ◽

2007 ◽

pp. 188-202 ◽

Cited By ~ 2

Author(s):

Florent Kirchner

Keyword(s):

Order Theory ◽

First Order ◽

First Order Theory

Download Full-text

Deciding Equality in the Constructor Theory

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

10.1007/978-3-540-74464-1_6 ◽

2007 ◽

pp. 78-92 ◽

Cited By ~ 4

Author(s):

Pierre Corbineau

Download Full-text

Crafting a Proof Assistant

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

10.1007/978-3-540-74464-1_2 ◽

2007 ◽

pp. 18-32 ◽

Cited By ~ 11

Author(s):

Andrea Asperti ◽

Claudio Sacerdoti Coen ◽

Enrico Tassi ◽

Stefano Zacchiroli

Keyword(s):

Proof Assistant

Download Full-text

Subset Coercions in Coq

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

10.1007/978-3-540-74464-1_16 ◽

2007 ◽

pp. 237-252 ◽

Cited By ~ 25

Author(s):

Matthieu Sozeau

Download Full-text

Truth Values Algebras and Proof Normalization

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

10.1007/978-3-540-74464-1_8 ◽

2007 ◽

pp. 110-124 ◽

Cited By ~ 5

Author(s):

Gilles Dowek

Keyword(s):

Truth Values

Download Full-text

Curry-Style Types for Nominal Terms

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

10.1007/978-3-540-74464-1_9 ◽

2007 ◽

pp. 125-139 ◽

Cited By ~ 3

Author(s):

Maribel Fernández ◽

Murdoch J. Gabbay

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs

Zermelo’s Well-Ordering Theorem in Type Theory

Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory

A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family

A Finite First-Order Theory of Classes

Deciding Equality in the Constructor Theory

Crafting a Proof Assistant

Subset Coercions in Coq

Truth Values Algebras and Proof Normalization

Curry-Style Types for Nominal Terms

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