378 search results - page 67 / 76 » Higher-order transformation of logic programs |
VL
2007
IEEE
14 years 1 months ago
2007
IEEE
This articles submits the thesis that visual data modeling and programming languages are conveniently conceived as rendering, or ‘styling’, of conventional, textual languages....
POPL
2005
ACM
14 years 7 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
FLOPS
2004
Springer
14 years 23 days ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
LOPSTR
1998
Springer
13 years 11 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...