Efficient Closure Utilisation by Higher-Order Inheritance Analysis
Abstract elided by the publisher.
783 papers · page 38 of 40
System F and Abstract Interpretation
Abstract elided by the publisher.
Call-By-Name CPS-Translation as a Binding-Time Improvement
Abstract elided by the publisher.
IGOR: A Tool for Developing Prolog Dataflow Analyzers
Abstract elided by the publisher.
Trust in the lambda-Calculus
Abstract elided by the publisher.
LSign Reordered
Abstract elided by the publisher.
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs
Abstract elided by the publisher.
Abstract Reduction Using a Tableau Calculus
Abstract elided by the publisher.
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)
Abstract elided by the publisher.
Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages
Abstract elided by the publisher.
Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell
Abstract elided by the publisher.
Region Inference for Higher-Order Functional Languages
Abstract elided by the publisher.
Binding-Time Analysis and Strictness Analysis by Abstract Interpretation
Abstract elided by the publisher.
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
Abstract elided by the publisher.
Constraint-Based Type Inference and Parametric Polymorphism
Abstract elided by the publisher.
Directional Type Checking of Logic Programs
Abstract elided by the publisher.
Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation
Abstract elided by the publisher.
Stackability in the Simply-Typed Call-by-Value Lambda Calculus
Abstract elided by the publisher.
A Systematic Construction of Abstract Domains
Abstract elided by the publisher.
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop
Abstract elided by the publisher.