Sciweavers

303 search results - page 32 / 61
» Theory Interpretation in Simple Type Theory
Sort
View
CADE
2006
Springer
14 years 8 months ago
Cut-Simulation in Impredicative Logics
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
Christoph Benzmüller, Chad E. Brown, Michael ...
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
AGTIVE
2007
Springer
14 years 1 months ago
Using Graph Transformation to Support Collaborative Ontology Evolution
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
Pieter De Leenheer, Tom Mens
ICFP
2010
ACM
13 years 8 months ago
The gentle art of levitation
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
James Chapman, Pierre-Évariste Dagand, Cono...
DAARC
2009
Springer
216views Algorithms» more  DAARC 2009»
13 years 11 months ago
The Doubly Marked Reflexive in Chinese
We discuss an unusual reflexive construction in which the Chinese reflexive ziji appears twice, once before the verb and once after. We demonstrate that this is a distinct construc...
Alexis Dimitriadis, Min Que