Dale Miller and Alwen Tiu. Encoding generic judgments. In Proceedings of FSTTCS, number 2556 in LNCS, pages 18--32, December 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Formalization of an Ordered Logical Framework in Hybrid.. - Momigliano, Polakow (Correct)
....we reason (typically by inversion) in presence of hypothetical judgments. Inducting HOAS style over open terms is a major challenge [20] in this setting generic judgments are particularly problematic, but can be dealt with by switching to a more expressive SL, based on a eigenvariable encoding [12]. The new theory of terms in infinite context underlying the new version of Hybrid [2] directly supports this syntax. With that in place, we will be able, for example, to replay in a full HOAS style a notion of program equivalence based on bisimilarity [14] and finally approach at the right level ....
D. Miller and A. Tiu. Encoding generic judgments. In M. Agrawal and A. Seth, editors, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, number 2556 in LNCS, pages 18--34. Springer-Verlag, 2002.
A Proof Theory for Generic Judgments: An Extended - Miller, Tiu (2003) (Correct)
.... n:P n m n: P nm) ry(My M y) y:My open out x y P output in x M input (My) j Q j (Ny) Figure 4. The rules for the (late) calculus. Consider encoding calculus [19] using higher order abstract syntax following [17, 18]. Since we are focused here on abstractions in syntax, we shall deal with only finite calculus expression, that is, expressions without or defined constants. Extending this work to infinite process expressions should be possible by adding induction (as in [11] or co induction to our proof ....
....We use two predicates to encode the one step transition semantics for the calculus. The predicate of type p a p o encodes transitions involving free values and the predicate of type p (n a) n p) o encodes transitions involving bound values. Figure 4 (taken from [18]) contains the inference rules specifying the late version of the transitions for the calculus [19] In these rules, capital letters (possibly primed) are used to denote schema variables for inference rules: these schema variables have primitive types such as a, n, and p as well as functional ....
[Article contains additional citation context not shown here]
D. Miller and A. Tiu. Encoding generic judgments. In Proceedings of FSTTCS, number 2556 in LNCS, pages 18--32, December 2002.
A Logical Framework For Reasoning About Logical Specifications - Tiu (2004) (2 citations) Self-citation (Tiu) (Correct)
No context found.
Dale Miller and Alwen Tiu. Encoding generic judgments. In Proceedings of FSTTCS, number 2556 in LNCS, pages 18--32, December 2002.
A Formalization of an Ordered Logical Framework in Hybrid.. - Momigliano, Polakow (Correct)
No context found.
D. Miller and A. Tiu. Encoding generic judgments. In M. Agrawal and A. Seth, editors, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, number 2556 in LNCS, pages 18--34. Springer-Verlag, 2002.
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