66 search results - page 4 / 14 » Recursive Functions with Higher Order Domains |
135
Voted
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
134
Voted
AML
1998
15 years 3 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
116
Voted
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
141
Voted
KI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
163
Voted
POPL
1992
ACM
15 years 7 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...