The calculus of context relations
type: Item
instance of: scholarly article
title: The calculus of context relations
zbMATH Open document ID: 0706.68073
DOI: 10.1007/BF01178581
author: Gregor Snelting
published in: Acta Informatica
publication date: 1991-01-01T00:00:00Z
review text: We present the theory of context relations. Context relations are a method for incremental semantic analysis in language-specific editors, which is able to handle incomplete program fragments. The algorithm is generated from the definition of a language's static semantics and is based on inference rules and order-sorted unification. The paper presents the underlying mathematical theory, optimal incremental analysis algorithms, handling of user-defined polymorphism and overloading, and implementation issues. It is intended as the concluding report on a by now mature concept, which has successfully been used to generate efficient incremental type inferencers or languages like ADA and Fortran 8x.
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 4160150
zbMATH Keywords: calculus of context relations
zbMATH Keywords: semantic analysis
zbMATH Keywords: semantics
zbMATH Keywords: inference
zbMATH Keywords: order-sorted unification
zbMATH Keywords: incremental type inferencers
describes a project that uses: Centaur
describes a project that uses: Ada95
describes a project that uses: mini-ML
describes a project that uses: ML
MaRDI profile type: Publication
cites work: Q5452362
cites work: Q5663380
cites work: Q3338216
cites work: A unification algorithm for typed \(\overline\lambda\)-calculus
cites work: Q3703312
cites work: Q3707340
cites work: Q3774923
cites work: Q3668890
cites work: Boolean unification - the story so far
cites work: Order-sorted unification
cites work: A theory of type polymorphism in programming
cites work: The relational model with relation-valued attributes
cites work: Computational aspects of an order-sorted logic with term declarations
cites work: Q3992707
cites work: Q3026314
cites work: On incremental evaluation of ordered attributed grammars
Recommended article: RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
Recommended article: Relational and Kleene-Algebraic Methods in Computer Science
Recommended article: Semantics of a relational \(\lambda\)-calculus
Recommended article: Q3137162
Recommended article: Relational reasoning about contexts
Recommended article: The \(\lambda\)-context calculus
Recommended article: Q4012876
Recommended article: On Automating the Calculus of Relations
Recommended article: A calculus of lambda calculus contexts
description: scientific article; zbMATH DE number 4160150