Dialgebraic Logics
نویسندگان
چکیده
منابع مشابه
Dialgebraic Logics (Extended Abstract)
We extend the notion of a rst{order signature in such a way that the type con-structors used to deene domain and codomain of the fundamental operations are taken to be a constituent part of the signature. Using the generative power of the type constructors and the fundamental types and operations we obtain a general construction of a category of typed terms which will be called syntactic catego...
متن کاملDialgebraic Specification and Modeling
ion and restriction Let SP ′ = (Σ′, AX ′) be a swinging type with base type SP = (Σ, AX) and primitive subtype SP0 = (Σ0, AX0), σ be the relation transformer of SP ′ and A be an SP0model. Suppose that SP ′ satisfies (7). Let Ini be initial in ModEU(A, SP ). If σ is continuous, then lfp(σ)/≡ is initial in ModEU(A, SP ′). Suppose that SP ′ satisfies (8). Let Ini be initial in ModEU(A, SP ). If σ ...
متن کاملDialgebraic Semantics of Typed Object Calculi
Algebraic data type theory has a notion of structural recursion. Coalgebraic data types similarly have a notion of structural corecursion. In this thesis we study a third form of recursion: direcursion. The other two notions have been used in program derivations, correctness proofs, and in foundations of functional and class-based languages. Direcursion, on the other hand, has not been extensiv...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملJustification logics and hybrid logics
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00062-3