1027 search results - page 135 / 206 » Representing and Reasoning with Operational Semantics |
113
Voted
AAAI
2007
15 years 3 months ago
2007
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
132
Voted
LCPC
1995
Springer
15 years 4 months ago
1995
Springer
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
90
Voted
ICFP
2003
ACM
16 years 18 days ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
122
Voted
ICFP
2003
ACM
16 years 18 days ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
113
Voted
LOPSTR
1997
Springer
15 years 4 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...