scientific article; zbMATH DE number 1343506
From MaRDI portal
Publication:4267198
zbMath0935.68011MaRDI QIDQ4267198
Publication date: 23 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Data structures (68P05) General topics in the theory of software (68N01)
Related Items (18)
Monotone recursive types and recursive data representations in Cedille ⋮ Unnamed Item ⋮ Algebraic-coalgebraic recursion theory of history-dependent dynamical system models ⋮ Folding over neural networks ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Unifying structured recursion schemes ⋮ Unifying Guarded and Unguarded Iteration ⋮ Generalised Coinduction ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Termination checking with types ⋮ Ramified Corecurrence and Logspace ⋮ Substitution in non-wellfounded syntax with variable binding ⋮ Some Remarks on Type Systems for Course-of-value Recursion ⋮ Recursive coalgebras from comonads ⋮ Least and greatest fixed points in intuitionistic natural deduction ⋮ Generalizing Substitution ⋮ Two extensions of system F with (co)iteration and primitive (co)recursion principles ⋮ Structural operational semantics for continuous state stochastic transition systems
This page was built for publication:
