Sciweavers

119 search results - page 1 / 24
» Automatic Testing of Higher Order Functions
Sort
View
APLAS
2006
ACM
13 years 10 months ago
Automatic Testing of Higher Order Functions
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...
Pieter W. M. Koopman, Rinus Plasmeijer
JAR
2008
77views more  JAR 2008»
13 years 4 months ago
Translating Higher-Order Clauses to First-Order Clauses
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 ...
Jia Meng, Lawrence C. Paulson
ENTCS
2006
176views more  ENTCS 2006»
13 years 4 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
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...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
APLAS
2004
ACM
13 years 9 months ago
Automatic Generation of Editors for Higher-Order Data Structures
With generic functional programming techniques, we have eased GUI programming by constructing a programming toolkit with which one can create GUIs in an abstract and compositional ...
Peter Achten, Marko C. J. D. van Eekelen, Rinus Pl...
LISP
2008
165views more  LISP 2008»
13 years 4 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind