28 search results - page 2 / 6 » Typed Higher-Order Narrowing without Higher-Order Strategies |
ESOP
2009
Springer
14 years 7 days ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
CSL
1999
Springer
13 years 9 months ago
1999
Springer
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
ITP
2010
13 years 9 months ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
IFL
2003
Springer
13 years 10 months ago
2003
Springer
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...