M. Hagiya, Y. Toda. On implicit arguments. Technical Report TR-95-1, Department of Information Science, University of Tokyo, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
More On Implicit Syntax - Luther (Correct)
....inference of the type argument of nil . M. Luther sometimes does not hide arguments at marked positions, even when they are inferable. Both defects result from di#culties to define reduction for a language with forced arguments properly since uniqueness of elaboration cannot be decided locally [HT95]. This paper solves the problems and limitations caused by the usage of implicit syntax in current proof assistants by proposing a stronger elaboration algorithm and by complementing it with an erasure algorithm that guarantees unique elaboration. The elaboration algorithm is stronger than the ....
....in long ## normal form, given a fully explicit expected type. This special setting enables the precomputing of large parts of the erasure for constants. While a language generated by implicit syntax is natural to humans, it seems rather di#cult to give it a direct foundation. Hagiya and Toda [HT95] have implemented an implicit version of CC directly using a typed version of # reduction defined on the implicit language. Several complicated syntactic restrictions have to be imposed to ensure decidability of type inference and to avoid dynamic type checking during reduction. On the ....
M. Hagiya, Y. Toda. On implicit arguments. Technical Report TR-95-1, Department of Information Science, University of Tokyo, 1995.
The Implicit Calculus of Constructions - Extending Pure Type.. - Miquel (Correct)
....the user may sometimes be confused by the fact that the system keeps implicit arguments behind its back, especially when two (dependent) types are printed identically although they are not internally identical, due to hidden implicit arguments. A Calculus with really implicit arguments. In [6], M. Hagyia and Y. Toda have studied the possibility of dropping implicit arguments out of the internal representation of the terms of the bicolored Calculus of Constructions that is, the Calculus of Constructions with explicit and implicit constructors. Their work is based on the idea that if we ....
....implicit terms in order to ensure decidability and uniqueness (up to conversion) of the reconstruction of implicit arguments. But their restriction actually seems to bee too drastic, since it forbids the use of the implicit abstraction in order to avoid dynamic type checking during reduction [6]. The theoretical approach of Type Assignment Systems On the theoretical side, many Curry style formalisms have been proposed as implicit counterparts of usual Pure Type Systems, such as the Curry style system F [8] In [5] P. Giannini et al. proposed an uniform description of Curry style ....
M. Hagiya and Y. Toda. On implicit arguments. Technical Report 95-1, Department of Information Science, Faculty of Science, University of Tokyo, 1995.
Boomborg-PC: A Proof-Checker of Calculus of Constructions Running .. - Hagiya (1995) (1 citation) Self-citation (Hagiya) (Correct)
....andER assume, the arguments corresponding to X and Y are implicit and are not supplied. Implicit arguments are obtained by (first order) unification while the line is typechecked. In the above example, the argument corresponding to X is U, and the argument corresponding to Y is V. Refer to [4] for more discussions on implicit arguments. Similarly, the line andER assume should become andER assume ) V after check is executed. However, since the definition of andER is erroneous, an error message is reported. In order to eliminate the error, we modify the definition of andER as ....
Hagiya,M., Toda,Y.: On Implicit Arguments, TR-95-1, Department of Information Science, University of Tokyo, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC