Sciweavers

92 search results - page 15 / 19
» The simply typed rewriting calculus
Sort
View
AML
2005
84views more  AML 2005»
13 years 7 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite
ENTCS
2007
91views more  ENTCS 2007»
13 years 7 months ago
A Logic for Reasoning about Generic Judgments
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...
Alwen Tiu
DLS
2008
149views Languages» more  DLS 2008»
13 years 9 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump