Sciweavers

8446 search results - page 995 / 1690
» A Process Compensation Language
Sort
View
ICFP
2003
ACM
16 years 7 months ago
Polish parsers, step by step
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
R. John M. Hughes, S. Doaitse Swierstra
ESOP
2010
Springer
16 years 4 months ago
Explicit Stabilisation for Modular Rely-Guarantee Reasoning
Abstract. We propose a new formalisation of stability for Rely-Guarantee, in which an assertion's stability is encoded into its syntactic form. This allows two advances in mod...
John Wickerson, Matthew J. Parkinson, Mike Dodds
VL
2009
IEEE
156views Visual Languages» more  VL 2009»
16 years 2 months ago
Non-programmers identifying functionality in unfamiliar code: Strategies and barriers
Source code on the web is a widely available and potentially rich learning resource for nonprogrammers. However, unfamiliar code can be daunting to end-users without programming e...
Paul A. Gross, Caitlin Kelleher
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
16 years 2 months ago
Hiding real-time: A new approach for the software development of industrial robots
—Software development for industrial robots is still strongly limited by the use of old-style robot programming languages. These languages are tailored to meet a special requirem...
Alwin Hoffmann, Andreas Angerer, Frank Ortmeier, M...
CSL
2009
Springer
16 years 2 months ago
Nominal Domain Theory for Concurrency
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
David Turner, Glynn Winskel