2018 search results - page 11 / 404 » Code Normal Forms |
115
click to vote
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
ISSAC
2005
Springer
15 years 5 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
83
Voted
ACL
2008
15 years 1 months ago
2008
The standard set of rules defined in Combinatory Categorial Grammar (CCG) fails to provide satisfactory analyses for a number of syntactic structures found in natural languages. T...
103
click to vote
FLAIRS
2007
15 years 2 months ago
2007
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
ACL
1996
15 years 1 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...