1486 search results - page 291 / 298 » Mathematical Fuzzy Logics |
202
click to vote
POPL
2004
ACM
16 years 1 days ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
CADE
2001
Springer
16 years 22 hour ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
110
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
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...
WOLLIC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...