Titlebook: Semantics of Data Types; International Sympos Gilles Kahn,David B. MacQueen,Gordon Plotkin Conference proceedings 1984 Springer-Verlag Berl

改变立场

A basic Abstract Semantic Algebra,es of ASAs correspond to “actions” (or “processes”), and the operators correspond to primitive ways of combining actions. There are simple ASAs for the various independent “facets” of actions: a functional ASA for data-flow, an imperative ASA for assignments, a declarative ASA for bindings, etc. The

seroma

Deriving structural induction in LCF,y recursive and satisfy equational constraints. Structural induction for these types follows from fixed-point induction; induction for lazy types is only sound for a subclass of formulas..Structural induction is derived and discussed for several types, including lazy lists, finite lists, syntax tree

恶名声

Executable specification of static semantics,r. We would like to use more of Prolog‘s power (back-tracking for example) to specify the static semantics of programming languages with overloading, such as Ada. Other examples will be needed to improve the Typol formalism and to see exactly what its limits are, both from a theoretical and a practi

技术

Type inference and type containment, on the meanings of types and expressions. A typed language GR with polymorphic functions leads to the GR inference rules. With the addition of an "oracle" rule for equations between expressions, the GR rules become complete for a general class of semantic models of type inference. These . are model

似少年

背信

大炮

后来

A basic Abstract Semantic Algebra,nctional, imperative and declarative ASAs — and highlights their differences. We discuss the correctness of ASA specifications, and sketch the proof of the consistency and (limiting) completeness of the functional ASA, relative to a simple model..Some familiarity with denotational semantics and algebraic specifications is assumed.

残酷的地方

Building specifications in an arbitrary institution,mine the set of operations which results when the definitions are instantiated in an institution of first-order logic and compare these with the operations found in existing specification languages. The result of instantiating the operations in an institution of partial first-order logic is also discussed.

Engaged