(Enter summary)
Abstract: The operational semantics of a computation system is often
presented as inference rules or, equivalently, as logical theories. Specifications
can be made more declarative and high-level if syntactic details
concerning bound variables and substitutions are encoded directly into
the logic using term-level abstractions (#-abstraction) and proof-level abstractions
(eigenvariables). When one wishes to reason about relations
defined using term-level abstractions, generic judgment are generally... (Update)
Context of citations to this paper: More
...(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...
.... 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,...
Cited by: More
A Logical Framework For Reasoning About Logical Specifications - Tiu (2004)
(Correct)
A Formalization of an Ordered Logical Framework in Hybrid.. - Momigliano, Polakow
(Correct)
A Proof Theory for Generic Judgments: An Extended - Miller, Tiu (2003)
(Correct)
Similar documents (at the sentence level):
32.8%: Encoding Generic Judgments - Dale Miller Computer (2001)
(Correct)
Active bibliography (related documents): More All
0.7: A Proof Search Specification of the π-Calculus - Tiu, Miller
(Correct)
0.5: Nominal Logic Programming - Cheney (2004)
(Correct)
0.4: Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002)
(Correct)
Similar documents based on text: More All
0.6: A Proof Theory for Generic Judgments - Miller, Tiu (2003)
(Correct)
0.2: A Local System for Classical Logic - Brünnler, Tiu (2001)
(Correct)
0.2: Encryption as an abstract data-type: An extended abstract - Miller (2003)
(Correct)
Related documents from co-citation: More All
4: Reasoning with higher-order abstract syntax in a logical framework (context) - McDowell, Miller - 2001
3: Multi-level meta-reasoning with higher order abstract syntax (context) - Momigliano, Ambler - 2003
3: A hybrid encoding of Howe's method for establishing congruence of bisimilarity (context) - Momigliano, Ambler et al. - 2002
BibTeX entry: (Update)
D. Miller and A. Tiu. Encoding generic judgments. In Proceedings of FSTTCS, number 2556 in LNCS, pages 18--32, December 2002. http://citeseer.ist.psu.edu/article/miller02encoding.html More
@misc{ miller02encoding,
author = "D. Miller and A. Tiu",
title = "Encoding generic judgments",
text = "D. Miller and A. Tiu. Encoding generic judgments. In Proceedings of FSTTCS,
number 2556 in LNCS, pages 18--32, December 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/miller02encoding.html" }
Citations (may not include all citations):
906
A structural approach to operational semantics
- Plotkin - 1981
854
Information and Computation (context) - Milner, Parrow et al. - 1992
251
A logic programming language with lambda-abstraction
- Miller - 1991
233
Natural semantics (context) - Kahn - 1987
174
A unification algorithm for typed #-calculus (context) - Huet - 1975
172
Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
129
The foundation of a generic theorem prover
- Paulson - 1989
126
Higher-order critical pairs (context) - Nipkow - 1991
69
Abstract syntax and variable binding (context) - Fiore, Plotkin et al. - 1999
66
A new approach to abstract syntax involving binders
- Gabbay, Pitts - 1999
59
Semantical analysis of higher-order abstract syntax (context) - Hofmann - 1999
48
A logic for reasoning with higherorder abstract syntax (context) - McDowell, Miller - 1997
47
A logic programming approach to manipulating formulas and pr..
- Miller, Nadathur - 1987
44
internal mobility and agent-passing calculi (context) - Sangiorgi - 1996
39
A proof-theoretic approach to logic programming (context) - Hallnas, Schroeder-Heister - 1991
38
Proof Theoretic Approach to Specification Languages
- Chirimar - 1995
36
Unification of simply typed lambda-terms as logic programmin.. (context) - Miller - 1991
27
Abstractions in logic programming (context) - Miller - 1990
22
Rules of definitional reflection (context) - Schroeder-Heister - 1993
19
System description: Teyjus---a compiler and abstract machine.. (context) - Nadathur, Mitchell - 1999
19
Reasoning with higher-order abstract syntax in a logical fra.. (context) - McDowell, Miller - 2002
18
Some uses of higher-order logic in computational linguistics
- Miller, Nadathur - 1986
16
Forum: A multiple-conclusion specification language (context) - Miller - 1996
16
Higher order abstract syntax with induction IsabelleHOL Form.. (context) - Hirschko, order et al. - 2001
16
Reasoning in a Logic with Definitions and Induction (context) - McDowell - 1997
16
Encoding transition systems in sequent calculus
- McDowell, Miller et al. - 2001
15
Cut-elimination for a logic with definitions and induction
- McDowell, Miller - 2000
10
Abstract syntax for variable binders: An overview (context) - Miller - 2000
10
A fixpoint theorem in linear logic (context) - Girard - 1992
8
Cut-elimination in logics with definitional reflection (context) - Schroeder-Heister - 1992
8
A higher-order specification of the #-calculus (context) - Despeyroux - 2000
8
Foundational aspects of syntax
- Miller, Palamidessi - 1999
5
inductive type theory (context) - Honsell, Miculan et al. - 2001
4
Encoding generic judgments: Preliminary results (context) - Miller - 2001
2
Reasoning about Logic Programs Using Definitions and Inducti..
- Wajs - 2002
2
A computational logic approach to syntax and semantics (context) - Miller, Nadathur - 1985
1
available via httpwww (context) - Tiu, of et al. - 2002
Documents on the same site (http://www.cse.psu.edu/~dale/papers/recentpapers.html): More
The pi-Calculus as a Theory in Linear Logic: Preliminary Results - Miller (1992)
(Correct)
Higher-Order Quantification and Proof Search - Miller (2002)
(Correct)
Encryption as an abstract data-type: An extended abstract - Miller (2003)
(Correct)
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