311 search results - page 57 / 63 » A Bialgebraic Approach to Automata and Formal Language Theor... |
ICSE
1993
IEEE-ACM
13 years 11 months ago
1993
IEEE-ACM
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
ECAIW
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...