Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
....yet provide intrinsic means for representing common concepts and operations in its application domain. The particular lineage of logical frameworks we are concerned with in this paper started with the Automath languages [dB80] which originated the use of dependent types. It was followed by LF [HHP93], crystallizing the judgments as types principle. LF is based on a minimal type theory with only the dependent function type constructor . It nonetheless directly supports concise and elegant expression of variable renaming and capture avoiding substitution at the level of syntax, and ....
....have been based on a syntax in which not every term is canonical. A diculty is that equality cannot then be axiomatized in a manifestly decidable, syntax directed way. In their original presentation of LF, Harper et al. de ne equality in terms of convertibility, and do not address conversions [HHP93]. Strong normalization ensures that this notion of equality is decidable. However, the conversions pose a special diculty because of the lack of con uence for reduction in the case of non well typed terms. Since LF typing is dependent on equality, the attempt to de ne an equality based on ....
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
A Concurrent Logical Framework: the - Propositional Fragment Kevin (Correct)
....A logical framework is determined by an underlying meta logic or type theory and a methodology for representing the judgments and derivations of interest. The particular lineage of logical frameworks to which the present paper belongs started with the Automath languages [dB80] followed by LF [HHP93], crystallizing the representation principles of judgments as types and deductions as objects . LF is based on a minimal type theory with only the dependent function type constructor . The representation methodology expresses hypothetical judgments and hypothetical deductions that formalize ....
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
A Concurrent Logical Framework II: Examples and.. - Cervesato, Pfenning.. (2003) (2 citations) (Correct)
....yet provide intrinsic means for representing common concepts and operations in its application domain. The particular lineage of logical frameworks we are concerned with in this paper started with the Automath languages [dB80] which originated the use of dependent types. It was followed by LF [HHP93], crystallizing the judgments as types principle. LF is based on a minimal type theory with only the dependent function type constructor . It nonetheless directly supports concise and elegant expression of variable renaming and capture avoiding substitution at the level of syntax, and ....
....of copies of P . All communication occurs via input and output processes. The output process, uhvi, sends the message v on channel u. The corresponding input process, u(w) P , substitutes the output v for w in the body of P . Representation Following the standard LF representation methodology [HHP93], we represent the calculus s two syntactic classes with two new CLF types. Next, we represent the processes themselves as objects with type expr. Our representation will use higher order abstract syntax [Pfe01b] to represent the bound variable v in the restriction new v P and in the input ....
[Article contains additional citation context not shown here]
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
Substitution in Non-wellfounded Syntax with Variable Binding - Matthes, Uustalu (2003) (1 citation) (Correct)
.... kind inductive and coinductive constructors are the topic of [23,1,2] A very accessible extended presentation of aspects of Fiore, Plotkin and Turi s work [15] appears in [14] Hofmann [21] has given a category theoretic explanation of the higher order abstract syntax approach to variable binding [19,28]. To defend our engagement with non wellfounded syntax, we also refer to some uses of this avor of syntax. In proof theory, Mints work [24] from the 1970s on the normalization of in nite derivations (continuous normalization) has recently been revived by him and others [25,6] In rewriting, ....
Harper, H., F. Honsell and G. Plotkin. A framework for de ning logics. J. of ACM 40 (1993), pp. 143-184.
A Simplified Account of the Metatheory of Linear LF - Vanderwaart, Crary (2002) (6 citations) (Correct)
....terms and may therefore ignore the distinction between intuitionistic and linear hypotheses. 1 Introduction Decidability of type checking and the existence of canonical forms for welltyped terms are arguably the two most important metatheoretic results for a logical framework such as LF [5]. Type checking is essential because the checking of proofs reduces to type checking of the terms that represent them; canonical forms are crucial because it is the canonical terms (of certain types) that may be proven via an adequacy theorem to be in a meaningful correspondence with ....
....and conclusions or recommendations in this publication are those of the authors and do not re ect the views of this agency. Preprint submitted to Elsevier Preprint June 3, 2002 and so this approach encounters signi cant problems. The original presentation of LF by Harper, Honsell and Plotkin [5] (hereafter HHP ) avoided the diculties of reduction by using conversion as de nitional equality even though this destroyed the property that every term is equal to some canonical form. Felty s Canonical LF [4] is a version of LF where all well typed objects and families are in canonical ....
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
Tradeoffs in the Intensional Representation of Lambda Terms - Liang, Nadathur (Correct)
....representation of lambda terms in the implementation of programming languages and systems in which it is necessary to examine the structures of such terms during execution. The best known uses of of this kind of lambda terms appears within higher order metalanguages [16, 21] logical frameworks [9, 19] and proof development systems [5, 7, 20] Within these systems and formalisms, the terms of a chosen lambda calculus are used as data structures, with abstraction in these terms being used to encode binding notions in objects such as formulas, programs and proofs, and the attendant reduction ....
R. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
Faster Proof Checking in the Edinburgh Logical Framework - Stump, Dill (2002) (2 citations) (Correct)
.... veri able proofs has been widely recognized as valuable (e.g. 23, 4] Recently, applications like proof carrying code and proof carrying authentication have created a new need for proofs that can be eciently veri ed by a simple proof checker [15, 2] The Edinburgh Logical Framework (LF) [10] is a widely used meta language for representing proof systems for these applications. The representation is such that proof checking is reduced to LF type checking. The CVC ( a Cooperating Validity Checker ) 21] system has the capability to produce proofs in a variant of LF for valid formulas ....
....that the derived objects are always functional and not sometimes merely relational. Functionality up to equivalence will be a consequence of the equivalence of the annotation calculus with the standard presentation of LF, since LF enjoys unicity of classi ers up to equivalence (theorem 2. 4 of [10]) Notation 2 (derivable sequents) In addition to denoting sequents (theoretical objects) expressions like j e a will be used to denote the meta theoretic proposition that the corresponding sequent is derivable in the annotation calculus. 3.3 Equivalence with the standard calculus This ....
R. Harper, F. Honsell, and G. Plotkin. A Framework for De ning Logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
CVC: a Cooperating Validity Checker - Stump, Barrett, Dill (2002) (36 citations) (Correct)
....predicate symbols for arithmetic comparison. CVC implements a version of Fourier Motzkin variable elimination to handle inequalities. 3 Proofs CVC can optionally produce proofs for every formula it reports valid. The proofs are represented using a variant of the Edinburgh Logical Framework (LF) [5], extended with features for more conveniently representing multi arity functions like the tuple forming operator and n ary addition [12] The proofs can be e ciently checked by a proof checker called ea [11] which ships with CVC. 4 Cha Given the great advances that have been made in ....
R. Harper, F. Honsell, and G. Plotkin. A Framework for De ning Logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
Comparing Higher-Order Encodings in Logical.. - Bruni, Honsell.. (2002) (2 citations) Self-citation (Honsell) (Correct)
....or integrated environment for each of them. Three research groups of the tosca project, in Milano, Pisa and Udine, have been actively involved in the area of metalanguages and metamodels developing and experimenting cospan span categories, tile logic (tl) 14, 4] and logical frameworks (e.g. lf) [15, 27], respectively. We refer the reader to [13] for a comparison between the two rst metamodels. In this paper, we discuss tile logic and logical frameworks. The foundations of both metamodels are by now well established, various tools based on them are available (e.g. 19, 7] and several case ....
....both in lf and tl, and we discuss and compare these encoding. Final remarks and directions for future work are in Section 4. Bruni et al. 1 The two Metalanguages and Encoding Protocols 1. 1 Logical Frameworks based on Type Theory Type Theories, such as the Edinburgh Logical Framework lf [15, 2] or the Calculus of (Co)Inductive Constructions [19] were especially designed, or can be fruitfully used, as a general logic speci cation language, i.e. as a Logical Framework (LF) In an LF, we can represent faithfully and uniformly all the relevant concepts of the inferential process in a ....
[Article contains additional citation context not shown here]
Harper, R., F. Honsell and G. Plotkin, A framework for de ning logics, Journal of the ACM 40 (1993), pp. 143-184.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
Proof Optimization Using Lemma Extraction - Rahul George Necula (Correct)
No context found.
Harper, R., Honsell, F., and Plotkin, G. A framework for de ning logics. In Symposium on Logic in Computer Science (June 1987), IEEE Computer Society Press, pp. 194-204.
Scalable Certification for Typed Assembly Language - Grossman, Morrisett (2000) (4 citations) (Correct)
No context found.
R. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. Journal of the ACM, 40(1):143-184, 1993.
Proof Irrelevance and Strict Definitions in a Logical Framework - Reed (2002) (2 citations) (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
Foundational Proof Checkers with Small Witnesses - Wu, Appel, Stump (2003) (3 citations) (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the ACM, 40(1):143-184, January 1993.
Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf.. - Abel (2004) (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin. A Framework for De ning Logics. Journal of the Association of Computing Machinery, 40(1):143{ 184, January 1993.
A Model for Declarative Programming and Specification with.. - Caires (1999) (Correct)
No context found.
R. W. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. JACM, 40(1):143-184, 1993.
Foundational Certified Code in a Metalogical Framework - Crary, Sarkar (2003) (2 citations) (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. Journal of the ACM, 40(1):143-184, January 1993.
Temporal-Safety Proofs for Systems Code - Henzinger, Jhala, Majumdar.. (2002) (11 citations) (Correct)
No context found.
R. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. Journal of the ACM, 40:143-184, 1993.
Linear Logic As A Framework For Specifying Sequent - Calculus Dale Miller (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin, A framework for de ning logics, Journal of the ACM, vol. 40 (1993), no. 1, pp. 143-184.
A Type System Equivalent to Model Checking - Naik (2003) (Correct)
No context found.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for de ning logics. In Proceedings of LICS'87, IEEE Symposium on Logic in Computer Science, pages 194-204, 1987.
Scalable Certification for Typed Assembly Language - Grossman, Morrisett (2000) (4 citations) (Correct)
No context found.
R. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. Journal of the ACM, 40(1):143-184, 1993.
On Functions and Types - Kamareddine (Correct)
No context found.
R. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. In Proceedings Second Symposium on Logic in Computer Science, pages 194-204, 1987.
Revisiting the Notion of Function - Kamareddine, Laan, Nederpelt (Correct)
No context found.
R. Harper, F. Honsell, and G. Plotkin. A framework for de ning logics. In Proceedings Second Symposium on Logic in Computer Science, pages 194-204, Washington D.C., 1987. IEEE.
Matching Constraints for the Lambda Calculus of Objects.. - Dipartimento Di.. (Correct)
No context found.
Harper R. Honsell F. and Plotkin G. A Framework for De ning Logics. J.ACM, 40(1):143-184, 1993.
Appendix 1: Product Types in F ! - In This Section (Correct)
No context found.
Harper, R., Honsell, F., and Plotkin, G., A Framework for De ning Logics, In 2nd Annual Symposium on Logic In Computer Science, IEEE Computer Society, Ithaca, New York, June 1987, 194-204.
First 50 documents
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