Logic programs as compact denotations.

DOI10.1016/S1477-8424(03)00023-XzbMath1059.68018OpenAlexW2073345936MaRDI QIDQ1426046

Fausto Spoto, Patricia M. Hill

Publication date: 14 March 2004

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1477-8424(03)00023-x

zbMATH Keywords

Static analysisDenotational semanticsAbstract interpretationLogic programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (1)

Deriving escape analysis by abstract interpretation

Uses Software

• ML
• BuDDy

Cites Work

• A theory of type polymorphism in programming
• A Foundation of Escape Analysis*
• Graph-Based Algorithms for Boolean Function Manipulation
• Bounded Fixed-Point Iteration
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logic programs as compact denotations.