199 search results - page 14 / 40 » Combining Strict and Soft Typing in Functional Programming |
141
click to vote
DEXA
1994
Springer
15 years 9 months ago
1994
Springer
We describe a functional database language OR-SML for handling disjunctive information in database queries, and its implementation on top of Standard ML 12]. The core language has ...
279
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
146
click to vote
TPHOL
2002
IEEE
15 years 10 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
147
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
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...
150
Voted
AML
1998
15 years 5 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...