230 search results - page 11 / 46 » Automation for Dependently Typed Functional Programming |
ESERNET
2003
Springer
14 years 26 days ago
2003
Springer
The origin of the study described here is the experiment performed by Basili and Selby, further replicated by Kamsties and Lott, and once again by Wood et al. These experiments inv...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
CASES
2005
ACM
13 years 9 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...
HASKELL
2005
ACM
14 years 1 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...