Publication:3875320
From MaRDI portal
zbMath0435.68015MaRDI QIDQ3875320
Publication date: 1980
68Q60: Specification and verification (program logics, model checking, etc.)
68N01: General topics in the theory of software
Related Items
Unnamed Item, Compiling laziness using projections, Lazy rewriting and eager machinery, Projections for polymorphic strictness analysis, Strictness and totality analysis with conjunction, From Boolean Equalities to Constraints, On the transformation between direct and continuation semantics, Making ``stricterness more relevant, Computational interpretations of linear logic, Refined typing to localize the impact of forced strictness on free theorems, Bi-inductive structural semantics, A refinement of strong sequentiality for term rewriting with constructors, Parameter-reduction of higher level grammars, Strictness analysis of the untyped \(\lambda\)-calculus, Strictness analysis via abstract interpretation for recursively defined types, Context-sensitive rewriting strategies, The powerset operator on abstract interpretations, Local higher-order fixpoint iteration, On collecting semantics for program analysis, Transforming Boolean equalities into constraints, Bi-inductive Structural Semantics