Shin-ya Katsumata  Home/Search
Context
Related
| kurims.kyotou.ac.jp/~...generalpre.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: kurims.kyotou.ac.jp/~sinya/pa... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predicates and composability of binary pre-logical relations in this generalised setting. This generalisation takes place in a categorical framework for typed higher-order abstract syntax and semantics [Fio02,MS03]. (Update)
Active bibliography (related documents): More All
1.1: Semantic and Syntactic Approaches to Simulation Relations - Hannay, Katsumata, Sannella (2003) (Correct)
0.8: Explicit Substitutions and Higher-Order Syntax (Extended Abstract) - Ghani (2003) (Correct)
0.5: Parametricity as a Notion of Uniformity in Reflexive Graphs - Dunphy (2002) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ katsumata-generalisation,
author = "Shin-ya Katsumata",
title = "A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems",
url = "citeseer.ist.psu.edu/737716.html" }
Citations (may not include all citations):229 Foundations for Programming Languages (context) - Mitchell - 1996
69 Abstract syntax and variable binding (context) - Fiore, Plotkin et al. - 1999
38 Categorical Logic and Type Theory (context) - Jacobs - 1999
28 Notes on sconing and relators - Mitchell, Scedrov - 1993
25 An axiomatic approach to binary logical relations with appli.. - Kinoshita, O'Hearn et al. - 1997
13 Lax logical relations - Plotkin, Power et al. - 2000
12 An axiomatization of computationally adequate domain theoret.. (context) - Fiore, Plotkin - 1994
10 Categories et Machines (context) - Lafont - 1988
7 Constructive data refinement in typed lambda calculus - Honsell, Longley et al. - 2000
4 Data-refinement for call-by-value programming languages (context) - Kinoshita, Power - 1999
3 Semantic analysis of normalisation by evaluation for typed l.. (context) - Fiore - 2002
2 A framework for typed HOAS and semantics - Miculan, Scagnetto - 2003
2 Second-order pre-logical relations and representation indepe.. (context) - Lei - 2001
2 Logical Predicates and Indeterminantes (context) - Hermida - 1993
2 Behavioural equivalence and indistinguishability in higher-o.. - Katsumata - 2003
2 The Lambda Calculus-Its Sytax and Semantics (context) - Barendregt - 1984
1 formerly Information and Control (context) - Honsell, Sannella et al. - 2002
1 Semantical analysis of higher-order abstract syntax (context) - Hoffman - 1999
Documents on the same site (http://www.kurims.kyoto-u.ac.jp/~sinya/paper/):
Behavioural Equivalence and Indistinguishability in Higher-Order .. - Katsumata (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