scientific article; zbMATH DE number 3679159
From MaRDI portal
Publication:3875320
zbMATH Open0435.68015MaRDI QIDQ3875320FDOQ3875320
Authors: Alan Mycroft 
Publication date: 1980
Title of this publication is not available (Why is that?)
General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (22)
- Bi-inductive structural semantics
- Local higher-order fixpoint iteration
- Strictness and totality analysis with conjunction
- Parameter-reduction of higher level grammars
- A refinement of strong sequentiality for term rewriting with constructors
- Strictness analysis via abstract interpretation for recursively defined types
- Strictness analysis of the untyped \(\lambda\)-calculus
- On the transformation between direct and continuation semantics
- Computational interpretations of linear logic
- Projections for polymorphic strictness analysis
- Transforming Boolean equalities into constraints
- The powerset operator on abstract interpretations
- Compiling laziness using projections
- Title not available (Why is that?)
- Dynamic interval analysis by abstract interpretation
- Making ``stricterness more relevant
- Refined typing to localize the impact of forced strictness on free theorems
- Lazy rewriting and eager machinery
- Bi-inductive structural semantics (extended abstract)
- Context-sensitive rewriting strategies
- From Boolean equalities to constraints
- On collecting semantics for program analysis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875320)
