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

9783540314288, 9783540314295

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Surreal Numbers in Coq

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

10.1007/11617990_11 ◽

2006 ◽

pp. 170-185 ◽

Cited By ~ 3

Author(s):

Lionel Elie Mamane

Keyword(s):

Surreal Numbers

Download Full-text

A Few Constructions on Constructors

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

10.1007/11617990_12 ◽

2006 ◽

pp. 186-200 ◽

Cited By ~ 11

Author(s):

Conor McBride ◽

Healfdene Goguen ◽

James McKinna

Download Full-text

A Uniform and Certified Approach for Two Static Analyses

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

10.1007/11617990_8 ◽

2006 ◽

pp. 115-137 ◽

Cited By ~ 6

Author(s):

Solange Coupet-Grimal ◽

William Delobel

Download Full-text

A Semi-reflexive Tactic for (Sub-)Equational Reasoning

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

10.1007/11617990_7 ◽

2006 ◽

pp. 98-114 ◽

Cited By ~ 3

Author(s):

Claudio Sacerdoti Coen

Keyword(s):

Equational Reasoning

Download Full-text

Solving Two Problems in General Topology Via Types

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

10.1007/11617990_9 ◽

2006 ◽

pp. 138-153 ◽

Cited By ~ 1

Author(s):

Adam Grabowski

Keyword(s):

General Topology

Download Full-text

On Constructive Existence

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

10.1007/11617990_17 ◽

2006 ◽

pp. 268-273

Author(s):

Michel Parigot

Download Full-text

Exploring the Regular Tree Types

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

10.1007/11617990_16 ◽

2006 ◽

pp. 252-267 ◽

Cited By ~ 9

Author(s):

Peter Morris ◽

Thorsten Altenkirch ◽

Conor McBride

Keyword(s):

Regular Tree

Download Full-text

Extracting a Normalization Algorithm in Isabelle/HOL

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

10.1007/11617990_4 ◽

2006 ◽

pp. 50-65

Author(s):

Stefan Berghofer

Download Full-text

A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis

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

10.1007/11617990_5 ◽

2006 ◽

pp. 66-81 ◽

Cited By ~ 19

Author(s):

Yves Bertot ◽

Benjamin Grégoire ◽

Xavier Leroy

Keyword(s):

Dataflow Analysis ◽

Compiler Optimizations ◽

Structured Approach

Download Full-text

Tactic-Based Optimized Compilation of Functional Programs

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

10.1007/11617990_13 ◽

2006 ◽

pp. 201-214 ◽

Cited By ~ 2

Author(s):

Thomas Meyer ◽

Burkhart Wolff

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Surreal Numbers in Coq

A Few Constructions on Constructors

A Uniform and Certified Approach for Two Static Analyses

A Semi-reflexive Tactic for (Sub-)Equational Reasoning

Solving Two Problems in General Topology Via Types

On Constructive Existence

Exploring the Regular Tree Types

Extracting a Normalization Algorithm in Isabelle/HOL

A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis

Tactic-Based Optimized Compilation of Functional Programs

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