This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
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...
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...
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...
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...