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