367 search results - page 10 / 74 » Adapting functional programs to higher order logic |
LICS
1999
IEEE
14 years 27 days ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
PADL
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
APLAS
2006
ACM
14 years 2 months ago
2006
ACM
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...
ENTCS
2006
13 years 8 months ago
2006
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
JAR
2008
13 years 8 months ago
2008
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...