Sciweavers

230 search results - page 23 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
JFP
2010
82views more  JFP 2010»
13 years 6 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes
FMCO
2003
Springer
123views Formal Methods» more  FMCO 2003»
14 years 26 days ago
Machine Function Based Control Code Algebras
Abstract. Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]....
Jan A. Bergstra
DATE
2003
IEEE
145views Hardware» more  DATE 2003»
14 years 29 days ago
Automated Bus Generation for Multiprocessor SoC Design
The performance of a system, especially a multiprocessor system, heavily depends upon the efficiency of its bus architecture. This paper presents a methodology to generate a custo...
Kyeong Keol Ryu, Vincent John Mooney
TLCA
2005
Springer
14 years 1 months ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta
LICS
1989
IEEE
13 years 11 months ago
Elf: A Language for Logic Definition and Verified Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Frank Pfenning