nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Simple Nominal Type Theory
|
Cheney, James |
|
|
228 |
C |
p. 37-52 |
artikel |
2 |
Case Analysis of Higher-Order Data
|
Dunfield, Jana |
|
|
228 |
C |
p. 69-84 |
artikel |
3 |
Explicit Contexts in LF (Extended Abstract)
|
Crary, Karl |
|
|
228 |
C |
p. 53-68 |
artikel |
4 |
Inductive Completeness of Logics of Programs
|
Leivant, Daniel |
|
|
228 |
C |
p. 101-112 |
artikel |
5 |
On the Expressivity of Minimal Generic Quantification
|
Baelde, David |
|
|
228 |
C |
p. 3-19 |
artikel |
6 |
On the Role of Names in Reasoning about λ-tree Syntax Specifications
|
Tiu, Alwen |
|
|
228 |
C |
p. 135-150 |
artikel |
7 |
Preface
|
Abel, Andreas |
|
|
228 |
C |
p. 1 |
artikel |
8 |
Proof Checking Technology for Satisfiability Modulo Theories
|
Stump, Aaron |
|
|
228 |
C |
p. 121-133 |
artikel |
9 |
Reasoning in Abella about Structural Operational Semantics Specifications
|
Gacek, Andrew |
|
|
228 |
C |
p. 85-100 |
artikel |
10 |
System Description: Delphin – A Functional Programming Language for Deductive Systems
|
Poswolsky, Adam |
|
|
228 |
C |
p. 113-120 |
artikel |
11 |
Type Theory Should Eat Itself
|
Chapman, James |
|
|
228 |
C |
p. 21-36 |
artikel |