Sciweavers

134 search results - page 21 / 27
» Higher-Order and Semantic Unification
Sort
View
POPL
1994
ACM
13 years 11 months ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus
EACL
1989
ACL Anthology
13 years 8 months ago
Inference in DATR
DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of applic...
Roger Evans, Gerald Gazdar
TPLP
2002
69views more  TPLP 2002»
13 years 7 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
FSTTCS
2005
Springer
14 years 27 days ago
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a ty...
Jens Chr. Godskesen, Thomas T. Hildebrandt
ESOP
2008
Springer
13 years 9 months ago
Open Bisimulation for the Concurrent Constraint Pi-Calculus
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...
Maria Grazia Buscemi, Ugo Montanari