Sciweavers

1549 search results - page 157 / 310
» On the rules of intermediate logics
Sort
View
ICFP
2005
ACM
14 years 9 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 9 months ago
A Generic Analysis Environment for Curry Programs
We present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the program code of an application...
Michael Hanus
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 3 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
LICS
2006
IEEE
14 years 3 months ago
Saturated Semantics for Reactive Systems
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
Filippo Bonchi, Barbara König, Ugo Montanari
DLOG
2001
13 years 10 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat