
TECHNICAL ANNEX LOGCOMP Logic and Computation
– Centro Algoritmi Th


CPS Transform for Dependent ML
– Hongwei Xi, Carsten Schürmann


A Representation of Fω in LF
– Carsten Schürmann, Dachuan Yu, Zhaozhong Ni


CPS Transform and Type Derivations in Dependent ML (Extended Abstract)
– Hongwei Xi, Carsten Schürmann

6

Representing Proof Transformations for Program Optimization
– Penny Anderson
 1994

3

Program Extraction in a Logical Framework Setting
– Penny Anderson
 1994

1

Attributive Types for Proof Erasure ⋆
– Hongwei Xi

14

Dependently Typed Data Structures
– Hongwei Xi
 1999

7

Facilitating Program Verification with Dependent Types
– Hongwei Xi
 2003

5

Specifying Interactions With Dependent Types
– Peter Hancock, Anton Setzer
 2000


unknown title
– Jim Grundy, Tom Melham

10

Elimination of Negation in a Logical Framework
– Alberto Momigliano
 2000

2

ATS/LF: a type system for constructing proofs as total functional programs
– Hongwei Xi
 2004

18

Moving proofsasprograms into practice
– James L. Caldwell
 1997

5

Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory
– Frank Pfenning
 2001

17

A Structural Proof of Cut Elimination and Its Representation in a Logical Framework
– Frank Pfenning
 1994

2

Highlevel Proofs of Mathematical Programs Using Automatic Differentiation, Simplification, and some Common Sense
– Richard Fateman

10

Tradeoffs in the Intensional Representation of Lambda Terms
– Chuck Liang, Gopalan Nadathur
 2002

5

A Comparison of Formalizations of the MetaTheory of a Language with Variable Bindings in Isabelle
– A. Momigliano, S. J. Ambler, R. L. Crole
 2001
