Sciweavers

230 search results - page 24 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
FLOPS
2006
Springer
13 years 11 months ago
"Scrap Your Boilerplate" Reloaded
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
Ralf Hinze, Andres Löh, Bruno C. D. S. Olivei...
APLAS
2009
ACM
14 years 2 months ago
Witnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
Ben Lippmeier
TPHOL
2003
IEEE
14 years 28 days ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
APLAS
2007
ACM
13 years 11 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
LOPSTR
2007
Springer
14 years 1 months ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...