Electronic Notes in Theoretical Computer Science, Volume 228

Volume 228, January 2009

• Andreas Abel, Christian Urban:
  Preface. 1
  
• David Baelde:
  On the Expressivity of Minimal Generic Quantification. 3-19
  
• James Chapman:
  Type Theory Should Eat Itself. 21-36
  
• James Cheney:
  A Simple Nominal Type Theory. 37-52
  
• Karl Crary:
  Explicit Contexts in LF (Extended Abstract). 53-68
  
• Joshua Dunfield, Brigitte Pientka:
  Case Analysis of Higher-Order Data. 69-84
  
• Andrew Gacek, Dale Miller, Gopalan Nadathur:
  Reasoning in Abella about Structural Operational Semantics Specifications. 85-100
  
• Daniel Leivant:
  Inductive Completeness of Logics of Programs. 101-112
  
• Adam Poswolsky, Carsten Schürmann:
  System Description: Delphin - A Functional Programming Language for Deductive Systems. 113-120
  
• Aaron Stump:
  Proof Checking Technology for Satisfiability Modulo Theories. 121-133
  
• Alwen Tiu:
  On the Role of Names in Reasoning about lambda-tree Syntax Specifications. 135-150