2000 search results - page 110 / 400 » Program Transformation and Proof Transformation |
129
click to vote
PEPM
2004
ACM
15 years 8 months ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
125
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
164
Voted
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
145
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
123
click to vote
LISP
2008
15 years 3 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...