Sciweavers

1419 search results - page 26 / 284
» Notes on Formalizing Context
Sort
View
99
Voted
CADE
2007
Springer
16 years 24 days ago
System for Automated Deduction (SAD): A Tool for Proof Verification
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...
Konstantin Verchinine, Alexander V. Lyaletski, And...
110
Voted
ICCS
2005
Springer
15 years 6 months ago
Toward Cooperatively-Built Knowledge Repositories
After noting that informal documents and formal knowledge bases are far from ideal for discussing or retrieving technical knowledge, we propose mechanisms to support the sharing, r...
Philippe Martin, Michael Blumenstein, Peter J. Dee...
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
15 years 4 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
ICALP
2007
Springer
15 years 6 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
92
Voted
EACL
1993
ACL Anthology
15 years 1 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher