Point-free substitution

A. Bijlsma; C.S. Scholten

doi:10.1016/0167-6423(96)00010-X

Point-free substitution

A. Bijlsma, C.S. Scholten

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

1 Citation (Scopus)

Abstract

A new characterization of substitution, viz. as a universally conjunctive and universally disjunctive predicate transformer, is proposed. This characterization is also meaningful in point-free models for predicate calculus, and agrees with the classical definition of substitution whenever the latter is applicable.

Original language	English
Pages (from-to)	205-214
Journal	Science of Computer Programming
Volume	27
Issue number	2
DOIs	https://doi.org/10.1016/0167-6423(96)00010-X
Publication status	Published - 1996

Access to Document

10.1016/0167-6423(96)00010-X

Cite this

@article{752d48aa62c64defbec7c6ef2f6824d8,

title = "Point-free substitution",

abstract = "A new characterization of substitution, viz. as a universally conjunctive and universally disjunctive predicate transformer, is proposed. This characterization is also meaningful in point-free models for predicate calculus, and agrees with the classical definition of substitution whenever the latter is applicable.",

author = "A. Bijlsma and C.S. Scholten",

year = "1996",

doi = "10.1016/0167-6423(96)00010-X",

language = "English",

volume = "27",

pages = "205--214",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Point-free substitution

AU - Bijlsma, A.

AU - Scholten, C.S.

PY - 1996

Y1 - 1996

N2 - A new characterization of substitution, viz. as a universally conjunctive and universally disjunctive predicate transformer, is proposed. This characterization is also meaningful in point-free models for predicate calculus, and agrees with the classical definition of substitution whenever the latter is applicable.

AB - A new characterization of substitution, viz. as a universally conjunctive and universally disjunctive predicate transformer, is proposed. This characterization is also meaningful in point-free models for predicate calculus, and agrees with the classical definition of substitution whenever the latter is applicable.

U2 - 10.1016/0167-6423(96)00010-X

DO - 10.1016/0167-6423(96)00010-X

M3 - Article

VL - 27

SP - 205

EP - 214

JO - Science of Computer Programming

JF - Science of Computer Programming

SN - 0167-6423

IS - 2

ER -

Point-free substitution

Abstract

Access to Document

Fingerprint

Cite this