286 search results - page 20 / 58 » Reasoning About Partial Functions in the Formal Development ... |
HASKELL
2005
ACM
14 years 28 days ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
IFL
1997
Springer
13 years 11 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
AAAI
2010
13 years 8 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
OOPSLA
2004
Springer
14 years 22 days ago
2004
Springer
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...