844 search results - page 1 / 169 » More On Implicit Syntax |
CADE
2001
Springer
14 years 5 months 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...
COMPUTER
1998
13 years 4 months ago
1998
CC
2002
Springer
13 years 4 months ago
2002
Springer
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
CORR
2012
Springer
12 years 20 days ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
DBPL
2005
Springer
13 years 10 months ago
2005
Springer
XML is successful as a machine processable data interchange format, but it is often too verbose for human use. For this reason, many XML languages permit an alternative more legib...