Sciweavers

650 search results - page 51 / 130
» Logical Bisimulations and Functional Languages
Sort
View
ICFP
2010
ACM
13 years 7 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
DLOG
2009
13 years 5 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Fusing a Transformation Language with an Open Compiler
Transformation systems such as Stratego/XT provide powerful analysis and transformation frameworks and concise languages for language processing, but instantiating them for every ...
Karl Trygve Kalleberg, Eelco Visser
ICDE
1993
IEEE
103views Database» more  ICDE 1993»
13 years 11 months ago
IsaLog: A declarative language for complex objects with hierarchies
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
Paolo Atzeni, Luca Cabibbo, Giansalvatore Mecca
ICFP
2007
ACM
14 years 7 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni