Sciweavers

1742 search results - page 4 / 349
» An Applicative Module Calculus
Sort
View
ICFP
1999
ACM
14 years 1 days ago
Transparent Modules with Fully Syntactic Signatures
ML-style modules are valuable in the development and maintenance of large software systems, unfortunately, none of the existing languages support them in a fully satisfactory mann...
Zhong Shao
SEMWEB
2007
Springer
14 years 1 months ago
History Matters: Incremental Ontology Reasoning Using Modules
The development of ontologies involves continuous but relatively small modifications. Existing ontology reasoners, however, do not take advantage of the similarities between diffe...
Bernardo Cuenca Grau, Christian Halaschek-Wiener, ...
MSCS
2007
91views more  MSCS 2007»
13 years 7 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
13 years 12 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach
POPL
2009
ACM
14 years 8 months ago
Modeling abstract types in modules with open existential types
Abstract Types in Modules with Open Existential Types Beno?t Montagu Didier R?my INRIA {Benoit.Montagu, Didier.Remy}@inria.fr We propose F , a calculus of open existential types t...
Benoît Montagu, Didier Rémy