Sciweavers

603 search results - page 114 / 121
» A Formal Operational Semantics for SOFL
Sort
View
LOGCOM
1998
178views more  LOGCOM 1998»
14 years 11 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
POPL
2008
ACM
16 years 10 hour ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...
OTM
2009
Springer
15 years 6 months ago
Ontology-Driven Provenance Management in eScience: An Application in Parasite Research
Provenance, from the French word “provenir”, describes the lineage or history of a data entity. Provenance is critical information in scientific applications to verify experime...
Satya Sanket Sahoo, D. Brent Weatherly, Raghava Mu...
HASKELL
2009
ACM
15 years 6 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
PPDP
2007
Springer
15 years 5 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...