The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella