Sciweavers

1598 search results - page 39 / 320
» A Unified Computation Model for Functional and Logic Program...
Sort
View
143
Voted
LICS
2002
IEEE
15 years 9 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
138
Voted
LATA
2009
Springer
15 years 11 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
AINA
2006
IEEE
15 years 8 months ago
Towards an Unified Experimentation Framework for Protocol Engineering
The design and development process of complex systems require an adequate methodology and efficient instrumental support in order to early detect and correct anomalies in the func...
Laurent Dairaine, Ernesto Exposito, Herve Thalmens...
WCFLP
2005
ACM
15 years 10 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
133
Voted
AAAI
2004
15 years 5 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao