Sciweavers

615 search results - page 20 / 123
» Completeness of Combinations of Constructor Systems
Sort
View
CADE
2004
Springer
14 years 28 days ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
DAWAK
2001
Springer
14 years 1 days ago
Matchmaking for Structured Objects
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
Thomas Eiter, Daniel Veit, Jörg P. Mülle...
IWPC
2002
IEEE
14 years 14 days ago
Architecture Recovery of Dynamically Linked Applications: A Case Study
Most previously published case studies in architecture recovery have been performed on statically linked software systems. Due to the increase in use of middleware technologies, s...
Igor Ivkovic, Michael W. Godfrey
ICFP
2005
ACM
14 years 7 months ago
High-level views on low-level representations
This paper explains how the high-level treatment of datatypes in functional languages--using features like constructor functions and pattern matching--can be made to coexist with ...
Iavor S. Diatchki, Mark P. Jones, Rebekah Leslie
ICFP
2002
ACM
14 years 7 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski