199 search results - page 11 / 40 » Combining Strict and Soft Typing in Functional Programming |
130
click to vote
LISP
2002
15 years 3 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
134
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
148
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
139
click to vote
APLAS
2009
ACM
15 years 10 months ago
2009
ACM
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...
141
click to vote
JFP
2002
15 years 3 months ago
2002
We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML...