Sciweavers

106 search results - page 21 / 22
» Dialectic semantics for argumentation frameworks
Sort
View
POPL
1998
ACM
14 years 2 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
CIE
2005
Springer
13 years 11 months ago
Shrad: A Language for Sequential Real Number Computation
Since Di Gianantonio [1993] introduced his semantics for exact real omputation, there has always been a struggle to maintain data abstraction and efficiency as much as possible. T...
Amin Farjudian
SFP
2001
13 years 11 months ago
Function Types in Complete Type Inference
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
Manfred Widera, Christoph Beierle
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 4 months ago
Concrete Sentence Spaces for Compositional Distributional Models of Meaning
Coecke, Sadrzadeh, and Clark [3] developed a compositional model of meaning for distributional semantics, in which each word in a sentence has a meaning vector and the distributio...
Edward Grefenstette, Mehrnoosh Sadrzadeh, Stephen ...
ICFP
2005
ACM
14 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao