Expression transformers in B-GSL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2651, Issue , 2003, Pages 197-215

  Stoddart, Bill ^a   Zeyda, Frank ^a  

^a TEESSIDE UNIVERSITY   (United Kingdom)

Author keywords

B; Backtracking; Combining functional and imperative programming; Expression transformers; Predicate transformers; Reversible computation; Term transformers

Indexed keywords

ARTIFICIAL INTELLIGENCE; BORON; COMPUTER SCIENCE; COMPUTERS;

BACKTRACKING; EXPRESSION TRANSFORMERS; IMPERATIVE PROGRAMMING; PREDICATE TRANSFORMERS; REVERSIBLE COMPUTATIONS;

FUNCTIONAL PROGRAMMING;

EID: 24644516639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44880-2_14     Document Type: Article

References (14)

1. Jean-Raymond Abrial. The B Book. Cambridge University Press, 1996.
2. E C R Hehner. Bunch theory: A simple set theory for computer science. Information Processing Letters, 12.1 pp26-31, 1981.
3. E C R Hehner. A Practical Theory of Programming. Springer Verlag, 1993.
4. http://www.haskell.org. Haskell98, a non-strict purely functional language. Technical report, 1998.
5. J M Lucassen. Types and Effects, towards the integration of functional and imperitive programming. PhD thesis, MIT laboratory for computer science, 1987.
6. E Moggi. Notions of Computation and Monads. Information and Computation 93(1), 1991.
7. J Morris and A Bunkenburg. A theory of bunches. Acta Informatica, 37(8).
8. J M Morris. An easy route from functional to imperative programming. Presented at the 5th Irish Formal Methods Workshop, Trinity College, Dublin, July 2001.
9. J M Morris and A Bunkenburg. Term transformer semantics. Submitted to ACM Transactions on Programming Languages and Systems, 1999.
10. Greg Nelson. A Generalization of Dijkstra's Calculus. ACM Transactions on Programming Languages and Systems, Vol 11, No. 4, 1989.
11. W J Stoddart. An Execution Architecture for B-GSL. In Bowen J and Dunne S E, editors, ZB2000, Lecture Notes in Computer Science, no 1878, 2000.
12. W J Stoddart. Efficient reversibility with guards and choice. In M A Ertl, editor, 18th EuroForth, 2002. Available from: www.complang.tuwien.ac.at/anton/euroforth2002/papers/bill.rev.ps.gz.
13. W J Stoddart and F Zeyda. Implementing sets for reversible computation. In M A Ertl, editor, 18th EuroForth, 2002. Available from: www.complang.tuwien.ac.at/anton/euroforth2002/papers/bill.sets.ps.gz.
14. P Wadler. Monads for functional programming. In J Jeuring and E Meijer, editors, Advanced Functional Programming, Lecture notes in Computer Science, no 925, 1995.