Sciweavers

173 search results - page 8 / 35
» Types as Graphs: Continuations in Type Logical Grammar
Sort
View
ACL
2001
13 years 8 months ago
An Algebra for Semantic Construction in Constraint-based Grammars
We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to t...
Ann A. Copestake, Alex Lascarides, Dan Flickinger
PPDP
2009
Springer
14 years 4 hour ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
JOLLI
2007
88views more  JOLLI 2007»
13 years 7 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
POPL
2010
ACM
14 years 4 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
ASYNC
2001
IEEE
164views Hardware» more  ASYNC 2001»
13 years 11 months ago
Synthesis and Implementation of a Signal-Type Asynchronous Data Communication Mechanism
This paper describes the synthesis and hardware implementation of a signal-type asynchronous data communication mechanism (ACM). Such an ACM can be used in systems where a data-dr...
Alexandre Yakovlev, Fei Xia, Delong Shang