28 search results - page 5 / 6 » Typed Higher-Order Narrowing without Higher-Order Strategies |
PADL
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
CSL
2009
Springer
14 years 28 days ago
2009
Springer
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
LFP
1992
13 years 7 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
ICFP
2000
ACM
13 years 10 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...