3713 search results - page 140 / 743 » Constructing a Calculus of Programs |
133
Voted
AAAI
1998
15 years 4 months ago
1998
This paper describes a program called Pret that automates system identification, the process of finding a dynamical model of a black-box system. Pret performs both structural iden...
115
click to vote
GPCE
2007
Springer
15 years 9 months ago
2007
Springer
Modular Monadic Semantics (MMS) is a well-known mechanism for structuring modular denotational semantic definitions for programming languages. The principal attraction of MMS is ...
133
click to vote
TYPES
2004
Springer
15 years 8 months ago
2004
Springer
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
148
click to vote
ENTCS
2006
15 years 3 months ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
109
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...