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

9783540221647, 9783540248491

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Core Calculus of Higher-Order Mixins and Classes

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

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

2004 ◽

pp. 83-98

Author(s):

Lorenzo Bettini ◽

Viviana Bono ◽

Silvia Likavec

Keyword(s):

Higher Order

Download Full-text

Formal Proof Sketches

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

10.1007/978-3-540-24849-1_24 ◽

2004 ◽

pp. 378-393 ◽

Cited By ~ 25

Author(s):

Freek Wiedijk

Keyword(s):

Formal Proof ◽

Proof Sketches

Download Full-text

Rewriting Calculus with Fixpoints: Untyped and First-Order Systems

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

10.1007/978-3-540-24849-1_10 ◽

2004 ◽

pp. 147-161 ◽

Cited By ~ 10

Author(s):

Horatiu Cirstea ◽

Luigi Liquori ◽

Benjamin Wack

Keyword(s):

First Order

Download Full-text

A Constructive Proof of Higman’s Lemma in Isabelle

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

10.1007/978-3-540-24849-1_5 ◽

2004 ◽

pp. 66-82 ◽

Cited By ~ 8

Author(s):

Stefan Berghofer

Keyword(s):

Constructive Proof ◽

Higman's Lemma ◽

Higman’S Lemma

Download Full-text

Tailoring Filter Models

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

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

2004 ◽

pp. 17-33

Author(s):

Fabio Alessi ◽

Franco Barbanera ◽

Mariangiola Dezani-Ciancaglini

Download Full-text

Combining Incoherent Coercions for Σ -Types

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

10.1007/978-3-540-24849-1_18 ◽

2004 ◽

pp. 276-292

Author(s):

Yong Luo ◽

Zhaohui Luo

Download Full-text

First-Order Reasoning in the Calculus of Inductive Constructions

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

10.1007/978-3-540-24849-1_11 ◽

2004 ◽

pp. 162-177 ◽

Cited By ~ 6

Author(s):

Pierre Corbineau

Keyword(s):

First Order ◽

Calculus Of Inductive Constructions

Download Full-text

Type Inference for Nested Self Types

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

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

2004 ◽

pp. 99-114

Author(s):

Viviana Bono ◽

Jerzy Tiuryn ◽

Paweł Urzyczyn

Keyword(s):

Type Inference

Download Full-text

Inductive Families Need Not Store Their Indices

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

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

2004 ◽

pp. 115-129 ◽

Cited By ~ 30

Author(s):

Edwin Brady ◽

Conor McBride ◽

James McKinna

Download Full-text

Mobility Types in Coq

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

10.1007/978-3-540-24849-1_21 ◽

2004 ◽

pp. 324-337 ◽

Cited By ~ 1

Author(s):

Furio Honsell ◽

Ivan Scagnetto

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Core Calculus of Higher-Order Mixins and Classes

Formal Proof Sketches

Rewriting Calculus with Fixpoints: Untyped and First-Order Systems

A Constructive Proof of Higman’s Lemma in Isabelle

Tailoring Filter Models

Combining Incoherent Coercions for Σ -Types

First-Order Reasoning in the Calculus of Inductive Constructions

Type Inference for Nested Self Types

Inductive Families Need Not Store Their Indices

Mobility Types in Coq

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