Sciweavers

211 search results - page 35 / 43
» Reflective Programming in the Relational Algebra
Sort
View
ACTA
1998
81views more  ACTA 1998»
14 years 9 months ago
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
Lex Bijlsma, Rob Nederpelt
ECOOP
2007
Springer
15 years 1 months ago
Tracking Linear and Affine Resources with Java(X)
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
Markus Degen, Peter Thiemann, Stefan Wehr
AIPS
2008
14 years 12 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
CPHYSICS
2007
437views more  CPHYSICS 2007»
14 years 9 months ago
Python: a language for computational physics
Python is a relatively new computing language, created by Guido van Rossum (Tanenbaum et al, 1990), which is particularly suitable for teaching a course in computational physics. ...
P. H. Borcherds
JLP
2006
81views more  JLP 2006»
14 years 9 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter