Static extensivity analysis for \(\lambda\)-definable functions over lattices

DOI10.1007/BF03037293zbMath1103.68035OpenAlexW1972543258MaRDI QIDQ2493277

Hyunjun Eo, Kwangkeun Yi, Kwang-Moo Choe

Publication date: 12 June 2006

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037293

zbMATH Keywords

deductive systemconstraint solving procedurefunction extensivity

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• PAG

Cites Work

• Constructive versions of Tarski's fixed point theorems
• PAG -- an efficient program analyzer generator
• Abstract interpretation and application to logic programs
• A necessary and sufficient criterion for the monotonicity of Boolean functions with deterministic and stochastic applications
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Static extensivity analysis for \(\lambda\)-definable functions over lattices