632 search results - page 7 / 127 » Explicit Substitutions and Programming Languages |
ICFP
2003
ACM
14 years 22 days ago
2003
ACM
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
APLAS
2001
ACM
13 years 11 months ago
2001
ACM
The garbage collection is a safe and efficient method for managing the heap. However it is not efficient for temporary storages that are allocated often and deallocated quickly. R...
WOTUG
2008
13 years 9 months ago
2008
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell's monads provide a way to explicitly specify se...
TACS
1994
Springer
13 years 11 months ago
1994
Springer
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
IFL
2005
Springer
14 years 1 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...