3827 search results - page 367 / 766 » The Epsilon Generation Language |
183
click to vote
SIGSOFT
2000
ACM
15 years 11 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
178
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
177
click to vote
POS
1998
Springer
15 years 11 months ago
1998
Springer
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
196
click to vote
UML
1998
Springer
15 years 11 months ago
1998
Springer
The use of scenarios has become a popular technique for requirements elicitation and specification building. Since scenarios capture only partial descriptions of system behavior, ...
164
click to vote
ICFP
2000
ACM
15 years 10 months ago
2000
ACM
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...