What people are saying - Write a review
We haven't found any reviews in the usual places.
A New Method for Strictness Analysis on NonFlat Domains
Abstract Interpretation of Polymorphic Functions
Complexity Analysis for a Lazy HigherOrder Language
18 other sections not shown
abstract interpretation algorithm applied argument behaviour cell char circuit closure combinator compiler Computer Science cone construct constructor context cost data structures database defined definition denote dependent sum derivation described domain efficient elements entry points equations example exception handling expression finite firewall functional language Functional Programming Languages geometrization given graph handler Haskell higher-order higher-order functions implementation induction input lazy evaluation lookup machine modified multiset nfib node non-deterministic normal form notation operating system optimisations output pair parallel parser parsing partial evaluation perform pmap F polymorphic possible powerdomain primitive projection projection transformers proof psort queue recursive referential transparency relation representation result riffle rpmap Ruby rules semantics sequence sequential signal simulation sketch specification srch static stream strictness analysis string syntax term theorem transaction tree tuple update variable Wadler x:xs