3440 search results - page 313 / 688 » Logics For Context-Free Languages |
164
click to vote
WWW
2003
ACM
16 years 8 months ago
2003
ACM
Model-theoretic semantics is a formal account of the interpretations of legitimate expressions of a language. It is increasingly being used to provide Web markup languages with we...
174
click to vote
ICFP
2002
ACM
16 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
205
click to vote
POPL
2010
ACM
16 years 5 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
204
click to vote
ICFP
2000
ACM
16 years 1 days ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
180
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...