198 search results - page 25 / 40 » Time Equations for Lazy Functional (Logic) Languages |
92
Voted
IFL
2001
Springer
15 years 6 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
126
click to vote
NJC
2000
15 years 1 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
78
Voted
FORMATS
2007
Springer
15 years 8 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
124
Voted
REX
1991
15 years 5 months ago
1991
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...
114
click to vote
POPL
1995
ACM
15 years 5 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...