10 search results - page 1 / 2 » Foundations for the Implementation of Higher-Order Subtyping |
132
Voted
ICFP
1997
ACM
15 years 3 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
93
Voted
LICS
2012
IEEE
13 years 1 months ago
2012
IEEE
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
114
Voted
AGP
2010
IEEE
15 years 4 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
83
Voted
CADE
2001
Springer
15 years 11 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
109
Voted
ICFP
2000
ACM
15 years 3 months ago
2000
ACM
This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymo...