Sciweavers

632 search results - page 15 / 127
» Proving Invariants of Functional Programs
Sort
View
95
Voted
MODELLIERUNG
2008
15 years 1 months ago
Incremental Evaluation of OCL Invariants in the Essential MOF Object Model
: The management of metamodels is supported by runtime environments that enforce the well-formedness of (meta-)model instances. Beyond this basic functionality, additional capabili...
Miguel García, Ralf Möller
125
Voted
LISP
2008
165views more  LISP 2008»
15 years 13 days ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
90
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 14 days ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
83
Voted
NIPS
2007
15 years 1 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
AISC
2010
Springer
15 years 5 months ago
Formal Proof of SCHUR Conjugate Function
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
Franck Butelle, Florent Hivert, Micaela Mayero, Fr...