230 search results - page 18 / 46 » Automation for Dependently Typed Functional Programming |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily availa...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
JFP
2008
13 years 7 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...