Sciweavers

123 search results - page 15 / 25
» Semantic Generalisation and the Inference of Meaning
Sort
View
ICFP
2003
ACM
15 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
CADE
2004
Springer
15 years 2 months 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...
75
Voted
CORR
1998
Springer
145views Education» more  CORR 1998»
14 years 9 months ago
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
We here explore a "fully" lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger ...
Bonnie L. Webber, Aravind K. Joshi
PEPM
2009
ACM
15 years 6 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
OWLED
2008
14 years 11 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves