12452 search results - page 2094 / 2491 » An exploration of program as language |
185
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
197
click to vote
ENTCS
2006
15 years 6 months ago
2006
We present a Standard ML library for writing programs that automatically adjust to changes to their data. The library combines modifiable references and memoization to achieve eff...
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
175
click to vote
JFP
2008
15 years 6 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. ...
188
click to vote
ENTCS
2007
15 years 6 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...