Carsten Schurmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585--599, Paris, France, August 2001. Springer Verlag LNCS 2142. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Twelf - Schürmann (2002) Self-citation (Schurmann) (Correct)
No context found.
Carsten Schurmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585--599, Paris, France, August 2001. Springer Verlag LNCS 2142.
A Meta Linear Logical Framework - McCreight, Schürmann (2003) Self-citation (Schurmann) (Correct)
No context found.
Carsten Schurmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585--599, Paris, France, August 2001. Springer Verlag LNCS 2142.
Towards Proof Planning for ... - Schürmann, Autexier (2002) Self-citation (Schurmann) (Correct)
....about secure mobile code [App01] and proof carrying code [Nec97] Figure 2 shows the usual definition of LF as a three layered system consisting of objects M , types A, and kinds K. We slightly deviate from the standard notation and present a version of LF which includes block variables [Sch00,Sch01a,Sch01b] Block variables y are underlined and range over instances of a world #. We write # for those contexts # that contain only declarations of the form x : A, and x : L; #) They correspond to the standard contexts of LF. LF signatures denoted by # are standard, and substitutions # di#er ....
Carsten Schurmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585--599, Paris, France, August 2001. Springer Verlag LNCS 2142.
A Type-Theoretic Approach to Induction with Higher-Order Encodings - Schürmann (2001) Self-citation (Sch) (Correct)
....higher order representation techniques that violate exactly this condition. In this paper we develop induction principles for higherorder encodings in the setting of rst order intuitionistic logic. They differ from standard induction principles in that they rely on the concept of worlds [Sch01] which admits reasoning about open terms in regularly formed contexts. The soundness of these induction principles follows from external termination and coverage considerations about a realizability interpretation of proofs. 1 Introduction Reasoning by induction is common practice in ....
....the sound induction principle described in this paper that is based on the idea of distinguishing cases of canonical forms. It is expressive enough to reason about properties of logics, operational semantics, and abstract machines. The underlying assumption is called the regular world assumption [Sch01] which allows quanti ers to range over open objects whose free variables are declared in a regularly formed (and hence subject to reasoning) context. Those regular contexts are characterized by so called worlds whose structure may be freely chosen, but must be xed ahead of time [Sch00] The ....
[Article contains additional citation context not shown here]
Carsten Schurmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL
A Definitional Approach to Primitive Recursion over.. - Ambler, Crole.. (2003) (3 citations) (Correct)
No context found.
Carsten Schrmann. Recursion for higher-order encodings. In Proceedings of Computer Science Logic (CSL 2001), volume 2142 of Lecture Notes in Computer Science, pages 585--599, 2001.
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