scientific article

zbMath0568.68013MaRDI QIDQ3685171

Thomas Johnsson

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

functional programrewrite rulesLambda liftingtransforming programs to recursive equations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (20)

Partial parametrization eliminates multiple traversals of data structures ⋮ Rules + strategies for transforming lazy functional logic programs ⋮ Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL ⋮ Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant ⋮ Compiling a Functional Logic Language: The Fair Scheme ⋮ Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs ⋮ Flow analysis of lazy higher-order functional programs ⋮ Lambda calculus with explicit recursion ⋮ Efficient high-level parallel programming ⋮ Computing in unpredictable environments: semantics, reduction strategies, and program transformations ⋮ Refunctionalization at work ⋮ \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus ⋮ Properties of a first-order functional language with sharing ⋮ Making higher-order superposition work ⋮ Making higher-order superposition work ⋮ Folding left and right over Peano numbers ⋮ Usage counting analysis for lazy functional languages ⋮ A compact kernel for the calculus of inductive constructions ⋮ A functional correspondence between monadic evaluators and abstract machines for languages with computational effects ⋮ Lambda-dropping: Transforming recursive equations into programs with block structure

This page was built for publication: