JFP
2007
13 years 11 months ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
COMBINATORICS
2006
13 years 11 months ago
2006
The reduced canonical form of a loopfree game G is the simplest game infinitesimally close to G. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel pro...
ENTCS
2008
13 years 11 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
ICWE
2003
Springer
14 years 4 months ago
2003
Springer
This Web service tags morpholexically any Spanish word and it gets the corresponding forms starting from a canonical form and from the flexion asked for. In the verbs, it deals wit...