Logical relations, the Glossary
Logical relations are a proof method employed in programming language semantics to show that two denotational semantics are equivalent.[1]
Table of Contents
6 relations: Binary relation, Data type, Denotational semantics, Mathematical proof, Proof assistant, Semantics (computer science).
- Formal methods stubs
- Programming language semantics
Binary relation
In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain.
See Logical relations and Binary relation
Data type
In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types.
See Logical relations and Data type
Denotational semantics
In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the meanings of programming languages by constructing mathematical objects (called denotations) that describe the meanings of expressions from the languages. Logical relations and denotational semantics are programming language semantics.
See Logical relations and Denotational semantics
Mathematical proof
A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion.
See Logical relations and Mathematical proof
Proof assistant
In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human–machine collaboration.
See Logical relations and Proof assistant
Semantics (computer science)
In programming language theory, semantics is the rigorous mathematical study of the meaning of programming languages. Logical relations and semantics (computer science) are programming language semantics.
See Logical relations and Semantics (computer science)
See also
Formal methods stubs
- Apomorphism
- Automath
- Axiomatic semantics
- Boolean grammar
- Chaff algorithm
- David Watt (computer scientist)
- Duration calculus
- Formal Methods Europe
- Implication table
- International Conference on Software Engineering and Formal Methods
- Interval temporal logic
- Liquid Haskell
- Logical relations
- Modal clausal form
- PRISM model checker
- Paramorphism
- Permutation automaton
- Picture language
- Predicative programming
- Programming Research Group
- Refinement calculus
- Romeo Model Checker
- TAPAAL Model Checker
- Temporal logic of actions
- Term graph
- Terminal yield
- Trace theory
- Uninterpreted function
- Uppaal Model Checker
Programming language semantics
- Action semantics
- Algebraic semantics (computer science)
- Axiomatic semantics
- Call-by-push-value
- Denotational semantics
- J operator
- Liskov substitution principle
- Logical relations
- Normalisation by evaluation
- Observational equivalence
- Operational semantics
- Refocusing (semantics)
- Semantics (computer science)
- Unifying Theories of Programming