Sciweavers

669 search results - page 50 / 134
» Haskell program coverage
Sort
View
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
TPHOL
2005
IEEE
14 years 2 months ago
Axiomatic Constructor Classes in Isabelle/HOLCF
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with t...
Brian Huffman, John Matthews, Peter White
TBILLC
2005
Springer
14 years 2 months ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...
Jan van Eijck
CSL
2009
Springer
14 years 1 months ago
Upper Bounds on Stream I/O Using Semantic Interpretations
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
Marco Gaboardi, Romain Péchoux
FUIN
2010
156views more  FUIN 2010»
13 years 7 months ago
A Tutorial Implementation of a Dependently Typed Lambda Calculus
Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary t...
Andres Löh, Conor McBride, Wouter Swierstra