Sciweavers

1455 search results - page 159 / 291
» Programming in Logic with Constraints for Natural Language P...
Sort
View
ICFP
2008
ACM
14 years 9 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
JSC
2010
103views more  JSC 2010»
13 years 7 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
ICFP
2010
ACM
13 years 10 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
PADL
2004
Springer
14 years 2 months ago
Symbolic Execution of Behavioral Requirements
Message Sequence Charts (MSC) have traditionally been used as a weak form of behavioral requirements in software design; they denote scenarios which may happen. Live Sequence Chart...
Tao Wang, Abhik Roychoudhury, Roland H. C. Yap, S....
EACL
1989
ACL Anthology
13 years 10 months ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...