Relevant bibliographies by topics / Algebraic semantics

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Algebraic semantics'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 October 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algebraic semantics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algebraic semantics"

1

Maddux, Roger D. "Relation-algebraic semantics." Theoretical Computer Science 160, no. 1-2 (June 1996): 1–85. http://dx.doi.org/10.1016/0304-3975(95)00082-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Voutsadakis, George. "Categorical Abstract Algebraic Logic: Referential Algebraic Semantics." Studia Logica 101, no. 4 (June 28, 2013): 849–99. http://dx.doi.org/10.1007/s11225-013-9500-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Plotkin, Gordon, and John Power. "Semantics for Algebraic Operations." Electronic Notes in Theoretical Computer Science 45 (November 2001): 332–45. http://dx.doi.org/10.1016/s1571-0661(04)80970-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Eunsuk. "Basic Core Fuzzy Logics and Algebraic Routley–Meyer-Style Semantics." Axioms 10, no. 4 (October 25, 2021): 273. http://dx.doi.org/10.3390/axioms10040273.

Full text
Abstract:
Recently, algebraic Routley–Meyer-style semantics was introduced for basic substructural logics. This paper extends it to fuzzy logics. First, we recall the basic substructural core fuzzy logic MIAL (Mianorm logic) and its axiomatic extensions, together with their algebraic semantics. Next, we introduce two kinds of ternary relational semantics, called here linear Urquhart-style and Fine-style Routley–Meyer semantics, for them as algebraic Routley–Meyer-style semantics.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhu, Huibiao, Jifeng He, and Jonathan P. Bowen. "From algebraic semantics to denotational semantics for Verilog." Innovations in Systems and Software Engineering 4, no. 4 (September 5, 2008): 341–60. http://dx.doi.org/10.1007/s11334-008-0069-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Jin Zhuo, Li Xia Wang, Tong Li, Qian Yu, Na Zhao, and Fei Lu Hang. "The Algebraic Semantics of EPDL at Activity Level and Verification." Advanced Materials Research 756-759 (September 2013): 2306–10. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2306.

Full text
Abstract:
In recent years, algebraic semantics and its verification are increasingly important in software engineering. In this paper, firstly, the algebraic semantics of software evolution process description language (AS-EPDL) at activity level is explored. The algebraic semantics of activity level in EPDL provide an accurate framework for defining the semantics. In addition, the hierarchy-consistency and sufficient-completeness properties of the AS-EPDL at activity level are verified.
APA, Harvard, Vancouver, ISO, and other styles
7

Rossie, Jonathan G., and Daniel P. Friedman. "An algebraic semantics of subobjects." ACM SIGPLAN Notices 30, no. 10 (October 17, 1995): 187–99. http://dx.doi.org/10.1145/217839.217860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boronat, Artur, and José Meseguer. "An algebraic semantics for MOF." Formal Aspects of Computing 22, no. 3 (February 20, 2010): 269–96. http://dx.doi.org/10.1007/s00165-009-0140-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kupke, Clemens, Alexander Kurz, and Dirk Pattinson. "Algebraic Semantics for Coalgebraic Logics." Electronic Notes in Theoretical Computer Science 106 (December 2004): 219–41. http://dx.doi.org/10.1016/j.entcs.2004.02.037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Jin Zhuo, Li Xia Wang, Wei Wang, Xuan Zhang, Ye Qian, and Rui Zhu. "Algebraic Semantics-Based Verification for EPDL at Task Level." Advanced Materials Research 756-759 (September 2013): 2311–15. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2311.

Full text
Abstract:
The algebraic semantics has been applied to describe and verify semantics for a long period of time. In this paper, the algebraic semantics of EPDL of task level is studied. The paper is divided into two parts. In the first part, the initial algebraic semantics of EPDL (AS-EPDL) of task level is given. As a consequence of the practical purpose, we give the expansion type, which can help the modularization of programming. However, there are two key problems we should concern about when the expansion type is built - hierarchy-consistency and sufficient-completeness. Therefore, we give the verification of these two properties in the second part of the paper.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algebraic semantics"

1

Azevedo, Terceiro Antonio Soares de. "Semantics for an algebraic specification language." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2006. http://hdl.handle.net/10183/8126.

Full text
Abstract:
Prosoft é um grupo de pesquisa do Instituto de Informática da UFRGS, desenvolvido pelo grupo de pesquisa homônimo e coordenado pelo Professor Daltro José Nunes. O objetivo do projeto é desenvolver um ambiente de desenvolvimento de software completo, o Ambiente Prosoft, que é baseado nos conceitos de Modelos, Cálculo Lambda, Tipos Abstratos de Dados e Orientação a Objetos. Um dos componentes do Ambiente Prosoft é sua linguagem de especificação algébrica: o Prosoft Algébrico. Apesar de ser base e tema de diversos trabalhos no grupo de pesquisa Prosoft, o Prosoft Algébrico não tem sua semântica devidamente definida. Os trabalhos desenvolvidos até agora foram baseados em noções operacionais, e apresentam diferentes interpretações do Prosoft Algébrico. Esta dissertação apresenta uma especificação de semântica denotacional para o Prosoft Algébrico, compreendendo, entre outras características, sua primitiva de comunicação entre tipos de dados, chamada ICS, e sua notação gráfica para representação de instanciação de tipos abstratos de dados. Essa dissertação apresenta também um estudo sobre prototipação semântica usando a linguagem de programação Haskell. O conceito de Literate Programming e a proximidade entre Cálculo Lambda e Haskell foram cruciais no rápido desenvolvimento de uma implementação protótipo do Prosoft Algébrico, baseada na sua semântica especificada. As principais contribuições dessa dissertação incluem: uma interpretação precisa e sem ambiguidades do Prosoft Algébrico, através da especificação da sua semântica; a definição de semântica para a ICS, um conceito único (até o limite do nosso conhecimento) que fornece um mecanismo de passagem de mensagens entre tipos de dados algébricos; uma implementação protótipo do Prosoft Algébrico, que pode realmente ser utilizada para experimentar e testar a definição da linguagem e a especificação da semântica do Prosoft Algébrico; resultados sobre prototipação semântica de especificações tanto de semântica denotacional quanto de semântica operacional usando a linguagem de programação Haskell para desenvolvimento rápido de protótipos de linguagens baseados na sua semântica. Como grande parte do desenvolvimento do Ambiente Prosoft é realizado através de projetos de cooperação internacional e essa dissertação irá influenciar fortemente o seu desenvolvimento futuro, o texto foi escrito em inglês para facilitar a troca de informação entre o grupo Prosoft e seus parceiros estrangeiros.
Prosoft is a research project at Instituto de Informática da UFRGS, developed by the research group with the same name and coordinated by Professor Daltro José Nunes. The project’s goal is to develop a full software development environment, the Prosoft Environment, based on the concepts of Models, Lambda Calculus, Abstract Data Types and Object orientation. One of the components of the Prosoft Environment is its algebraic specification language: Algebraic Prosoft. Although being the basis and theme of several works in the Prosoft research group, Algebraic Prosoft doesn’t have its semantics properly defined. Works done up to now were based on operational notions and presented different interpretations of Algebraic Prosoft. This thesis presents a denotational semantics specification for Algebraic Prosoft, comprising, among other features, its “inter-data type” communication primitive, called ICS, and its graphical notation for representing instantiations of abstract data types. This thesis also presents a study of semantic prototyping using the Haskell programming language. The concept of Literate Programing and the proximity between lambda calculus and Haskell were crucial to the rapid development of a prototype implementation of Algebraic Prosoft, based on its specified semantics. This thesis’ main contributions include: a precise and unambiguous interpretation of Algebraic Prosoft, through a semantics specification; the definition of semantics to the ICS, a unique (to the best of our knowledge) concept that provides a messagepassing mechanism between algebraic data types; a prototype implementation of Algebraic Prosoft, which can actually be used to experiment and test the Algebraic Prosoft language definition and semantics specification; results regarding semantics prototyping of both denotational and operational semantics specifications using the Haskell programming language for rapid development of semantics-based prototypes of languages. Since a large portion of Prosoft Environment’s development is done through international cooperation projects and this thesis will strongly influence its future development, the text was written in English in order to facilitate the information exchange between the Prosoft research group and its foreign partners.
APA, Harvard, Vancouver, ISO, and other styles
2

Ross, Brian James. "An algebraic semantics of Prolog control." Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/585.

Full text
Abstract:
The coneptual distinction between logic and control is an important tenet of logic programing. In practice, however, logic program languages use control strategies which profoundly affect the computational behavior of programs. For example, sequential Prolog's depth-first-left-first control is an unfair strategy under which nontermination can easily arise if programs are ill-structured. Formal analyses of logic programs therefore require an explicit formalisation of the control scheme. To this ends, this research introduces an algebraic proccess semantics of sequential logic programs written in Milner's calculus of Communicating Systems (CCS). the main contribution of this semantics is that the control component of a logic programming language is conciesly modelled. Goals and clauses of logic programs correspond semantically to sequential AND and OR agents respectively, and these agents are suitably defined to reflect the control strategy used to traverse the AND/OR computation tree for the program. The main difference between this and other process semantics which model concurrency is that the processes used here are sequential. The primary control strategy studied is standard Prolog's left-first-depth-first control. CCS is descriptively robust, however, and a variety of other sequential control schemes are modelled, including breadth-first, predicate freezing, and nondeterministic strategies. The CCS semantics for a particular control scheme is typically defined hierarchically. For example, standard Prolog control is initially defined in basic CCS using two control operators which model goal backtracking and clause sequencing. Using these basic definitions, higher-level bisimilarities are derived, ehich are more closely mappable to Prolog program constructs. By using variuos algebraic properties of the control operators, as well as the stream domain and theory of observational equivalence from CCS, a programming calculus approach to logic program analysis is permitted. Some example applications using the semantics include proving program termination, verifying transformations which use cut, and characterising some control issues of partial evaluation. Since progress algebras have already been used to model concurrency, this thesis suggests that they are an ideal means for unifying the operational semantics of the sequential and concurrent paradigms of logic programming.
APA, Harvard, Vancouver, ISO, and other styles
3

Silva, Thiago Nascimento da. "Algebraic semantics for Nelson?s logic S." PROGRAMA DE P?S-GRADUA??O EM SISTEMAS E COMPUTA??O, 2018. https://repositorio.ufrn.br/jspui/handle/123456789/24823.

Full text
Abstract:
Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2018-03-02T23:39:14Z No. of bitstreams: 1 ThiagoNascimentoDaSilva_DISSERT.pdf: 675458 bytes, checksum: 9123812e69a846020d3cd6346e530e1e (MD5)
Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2018-03-13T18:55:45Z (GMT) No. of bitstreams: 1 ThiagoNascimentoDaSilva_DISSERT.pdf: 675458 bytes, checksum: 9123812e69a846020d3cd6346e530e1e (MD5)
Made available in DSpace on 2018-03-13T18:55:45Z (GMT). No. of bitstreams: 1 ThiagoNascimentoDaSilva_DISSERT.pdf: 675458 bytes, checksum: 9123812e69a846020d3cd6346e530e1e (MD5) Previous issue date: 2018-01-25
Al?m da mais conhecida l?gica de Nelson (?3) e da l?gica paraconsistente de Nelson (?4), David Nelson introduziu no artigo de 1959 "Negation and separation of concepts in constructive systems", com motiva??es de aritm?tica e construtividade, a l?gica que ele chamou de "?". Naquele trabalho, a l?gica ? definida por meio de um c?lculo (que carece crucialmente da regra de contra??o) tendo infinitos esquemas de regras, e nenhuma sem?ntica ? fornecida. Neste trabalho n?s tomamos o fragmento proposicional de ?, mostrando que ele ? algebriz?vel (de fato, implicativo) no sentido de Blok & Pigozzi com respeito a uma classe de reticulados residuados involutivos. Assim, fornecemos a primeira sem?ntica para ? (que chamamos de ?-?lgebras), bem como um c?lculo estilo Hilbert finito equivalente ? apresenta??o de Nelson. Fornecemos um algoritmo para construir ?-?lgebras a partir de ?-?lgebras ou reticulados implicativos e demonstramos alguns resultados sobre a classe de ?lgebras que introduzimos. N?s tamb?m comparamos ? com outras l?gicas da fam?lia de Nelson, a saber, ?3 e ?4.
Besides the better-known Nelson logic (?3) and paraconsistent Nelson logic (?4), in Negation and separation of concepts in constructive systems (1959) David Nelson introduced a logic that he called ?, with motivations of arithmetic and constructibility. The logic was defined by means of a calculus (crucially lacking the contraction rule) having infinitely many rule schemata, and no semantics was provided for it. We look in the present dissertation at the propositional fragment of ?, showing that it is algebraizable (in fact, implicative) in the sense of Blok and Pigozzi with respect to a class of involutive residuated lattices. We thus provide the first known algebraic semantics for ?(we call them of ?-algebras) as well as a finite Hilbert-style calculus equivalent to Nelson?s presentation. We provide an algorithm to make ?-algebras from ?-algebras or implicative lattices and we prove some results about the class of algebras which we have introduced. We also compare ? with other logics of the Nelson family, that is, ?3 and ?4.
APA, Harvard, Vancouver, ISO, and other styles
4

Klingler, Carol Diane. "Syntax-directed semantics-supported editing of algebraic specifications." Master's thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-01202010-020048/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stephenson, K. "An algebraic approach to syntax, semantics and compilation." Thesis, Swansea University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639106.

Full text
Abstract:
In this thesis, we develop an algebraic strategy and tools for modelling the syntax and semantics of programming languages and for proving the correctness of the process of compiling one language into another. Our first step in algebraically specifying language syntax is to apply a variation of an established technique of transforming a context-free grammar into a closed term algebra. Next, we design equational definitions of additional functions that act as a filter for the context-sensitive features of a language. To reduce the work involved in devising such specifications, we provide parameterised descriptions of commonly occurring language features. We illustrate the practicability of these modular methods by considering the algebraic specification of a range of programming languages and constructions. We then develop a modular algebraic method for defining operational semantics. The key to this is the employment of a notion of time by means of a simple clock, to enumerate the sequences of states produced by executing a program. We determine this behaviour by generating a sequence of atomic programs, such that the execution of each atomic program provides the next state in the execution sequence. We use functions that decompose the syntax one step at a time to determine which atomic program we should execute at each moment in time to simulate the behaviour of the entire program. We illustrate our technique with a wide-ranging set of examples. Finally, we describe how we can structure the compilation process using hierarchies of algebras, and how we can use equational methods to prove compiler correctness. The basis of our proof is in establishing correctness over just one step of time. We illustrate our technique with a case study of translating a high-level while language into instructions for a low-level register machine.
APA, Harvard, Vancouver, ISO, and other styles
6

Clarke, Daoud. "Context-theoretic Semantics for Natural Language: an Algebraic Framework." Thesis, University of Sussex, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.486979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fujinami, Tsutomu. "A process algebraic approach to computational linguistics." Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/521.

Full text
Abstract:
The thesis presents a way to apply process algebra to computational linguistics. We are interested in how contexts can affect or contribute to language understanding and model the phenomena as a system of communicating processes to study the interaction between them in detail. For this purpose, we turn to the pie-calculus and investigate how communicating processes may be defined. While investigating the computational grounds of communication and concurrency,we devise a graphical representation for processes to capture the structure of interaction between them. Then, we develop a logic, combinatory intuitionistic linear logic with equality relation, to specify communicating processes logically. The development enables us to study Situation Semantics with process algebra. We construct semantic objects employed in Situation Semantics in the pi-calculus and then represent them in the logic. Through the construction,we also relate Situation Semantics with the research on the information flow, Channel Theory, by conceiving of linear logic as a theory of the information flow. To show how sentences can be parsed as the result of interactions between processes, we present a concurrent chart parser encoded in the pi-calculus. We also explain how a semantic representation can be generated as a process by the parser. We conclude the thesis by comparing the framework with other approaches.
APA, Harvard, Vancouver, ISO, and other styles
8

Avery, Thomas Charles. "Structure and semantics." Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/29517.

Full text
Abstract:
Algebraic theories describe mathematical structures that are defined in terms of operations and equations, and are extremely important throughout mathematics. Many generalisations of the classical notion of an algebraic theory have sprung up for use in different mathematical contexts; some examples include Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. The purpose of an algebraic theory is to describe its models, which are structures in which each of the abstract operations of the theory is given a concrete interpretation such that the equations of the theory hold. The process of going from a theory to its models is called semantics, and is encapsulated in a semantics functor. In order to define a model of a theory in a given category, it is necessary to have some structure that relates the arities of the operations in the theory with the objects of the category. This leads to the second central notion of this thesis, that of an interpretation of arities, or aritation for short. We show that any aritation gives rise to a semantics functor from the appropriate category of proto-theories, and that this functor has a left adjoint called the structure functor, giving rise to a structure{semantics adjunction. Furthermore, we show that the usual semantics for many existing notions of algebraic theory arises in this way by choosing an appropriate aritation. Another aim of this thesis is to find a convenient category of monads in the following sense. Every right adjoint into a category gives rise to a monad on that category, and in fact some functors that are not right adjoints do too, namely their codensity monads. This is the structure part of the structure{semantics adjunction for monads. However, the fact that not every functor has a codensity monad means that the structure functor is not defined on the category of all functors into the base category, but only on a full subcategory of it. This deficiency is solved when passing to general proto-theories with a canonical choice of aritation whose structure{semantics adjunction restricts to the usual one for monads. However, this comes at a cost: the semantics functor for general proto-theories is not full and faithful, unlike the one for monads. The condition that a semantics functor be full and faithful can be thought of as a kind of completeness theorem | it says that no information is lost when passing from a theory to its models. It is therefore desirable to retain this property of the semantics of monads if possible. The goal then, is to find a notion of algebraic theory that generalises monads for which the semantics functor is full and faithful with a left adjoint; equivalently the semantics functor should exhibit the category of theories as a re ective subcategory of the category of all functors into the base category. We achieve this (for well-behaved base categories) with a special kind of proto-theory enriched in topological spaces, which we call a complete topological proto-theory. We also pursue an analogy between the theory of proto-theories and that of groups. Under this analogy, monads correspond to finite groups, and complete topological proto-theories correspond to profinite groups. We give several characterisations of complete topological proto-theories in terms of monads, mirroring characterisations of profinite groups in terms of finite groups.
APA, Harvard, Vancouver, ISO, and other styles
9

Martin, Clare. "Preordered categories and predicate transformers." Thesis, University of Oxford, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barros, Jose Bernado dos Santos Monteiro Vieira de. "Semantics of non-terminating systems through term rewriting." Thesis, University of Oxford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.260738.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algebraic semantics"

1

Palsberg, Jens, ed. Semantics and Algebraic Specification. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04164-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

M, Nivat, and Reynolds John C. 1935-, eds. Algebraic methods in semantics. Cambridge [Cambridgeshire]: Cambridge University Press, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Manes, Ernest G., and Michael A. Arbib. Algebraic Approaches to Program Semantics. New York, NY: Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4612-4962-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Grant, Malcolm, ed. Algebraic semantics of imperative programs. Cambridge, Mass: MIT Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Manes, Ernest G. Algebraic Approaches to Program Semantics. New York, NY: Springer New York, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

A, Arbib Michael, ed. Algebraic approaches to program semantics. New York: Springer-Verlag, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mäder, Roman E. Graph algebras, algebraic and denotational semantics. Zürich: ETH, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Font, Josep Maria, and Ramon Jansana. A General Algebraic Semantics for Sentenial Logics. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-662-21591-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ramón, Jansana, ed. A general algebraic semantics for sentential logics. Berlin: Springer-Verlag, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Milner, Robin. Operational and algebraic semantics of concurrent processes. Edinburgh: University of Edinburgh, Laboratoryfor Foundations of Computer Sciences, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Algebraic semantics"

1

Thatcher, Jim. "Algebraic semantics." In TAPSOFT '87, 287. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17660-8_63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Paoli, Francesco. "Algebraic Semantics." In Substructural Logics: A Primer, 201–20. Dordrecht: Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-017-3179-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gurevich, Yuri. "Algebraic operational semantics." In Lecture Notes in Computer Science, 1–2. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18625-5_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Villoria, Alejandro, Henning Basold, and Alfons Laarman. "Enriching Diagrams with Algebraic Operations." In Lecture Notes in Computer Science, 121–43. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57228-9_7.

Full text
Abstract:
AbstractIn this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad. Under the condition that this monad is monoidal and there is an adjunction between the free algebra functor and the underlying category functor, we construct an adjunction between symmetric monoidal categories and symmetric monoidal categories enriched over algebras for the monad. This allows us to devise an extension, and its semantics, of the ZX-calculus with probabilistic choices by freely enriching over convex algebras, which are the algebras of the finite distribution monad. We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.
APA, Harvard, Vancouver, ISO, and other styles
5

Reichel, Horst. "Specification Semantics." In Algebraic Foundations of Systems Specification, 131–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-59851-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Manes, Ernest G., and Michael A. Arbib. "Assertion Semantics." In Algebraic Approaches to Program Semantics, 98–115. New York, NY: Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4612-4962-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nestra, Härmel. "Fractional Semantics." In Algebraic Methodology and Software Technology, 278–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11784180_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rector, D. L. "Semantics in Algebraic Computation." In Computers and Mathematics, 299–307. New York, NY: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-9647-5_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Watt, David A. "Action Semantics in Retrospect." In Semantics and Algebraic Specification, 4–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04164-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Danvy, Olivier. "Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines." In Semantics and Algebraic Specification, 162–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04164-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algebraic semantics"

1

Luo, Junfu, Lili Xiao, Huibiao Zhu, and Ziqing Su. "Trace and Algebraic Semantics for Partial Store Order Memory Model." In 2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC), 2171–76. IEEE, 2024. http://dx.doi.org/10.1109/compsac61105.2024.00348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bogaerts, Bart, Joost Vennekens, and Marc Denecker. "Safe Inductions: An Algebraic Study." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/119.

Full text
Abstract:
In many knowledge representation formalisms, a constructive semantics is defined based on sequential applications of rules or of a semantic operator. These constructions often share the property that rule applications must be delayed until it is safe to do so: until it is known that the condition that triggers the rule will remain to hold. This intuition occurs for instance in the well-founded semantics of logic programs and in autoepistemic logic. In this paper, we formally define the safety criterion algebraically. We study properties of so-called safe inductions and apply our theory to logic programming and autoepistemic logic. For the latter, we show that safe inductions manage to capture the intended meaning of a class of theories on which all classical constructive semantics fail.
APA, Harvard, Vancouver, ISO, and other styles
3

Rossie, Jonathan G., and Daniel P. Friedman. "An algebraic semantics of subobjects." In the tenth annual conference. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/217838.217860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhao, Renyi, V. Narasimhan, and S. Sastry. "Algebraic Semantics for Complete Interaction Sequence." In TENCON 2005 - 2005 IEEE Region 10 Conference. IEEE, 2005. http://dx.doi.org/10.1109/tencon.2005.301157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gaffe, Daniel, and Annie Ressouche. "Algebraic Framework for Synchronous Language Semantics." In 2013 International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2013. http://dx.doi.org/10.1109/tase.2013.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Versmissen, Koen. "Categorial grammar, modalities and algebraic semantics." In the sixth conference. Morristown, NJ, USA: Association for Computational Linguistics, 1993. http://dx.doi.org/10.3115/976744.976788.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Aguzzoli, Stefano, and Brunella Gerla. "Invertible substitutions in logics with algebraic semantics equivalent to Product algebras." In 2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2022. http://dx.doi.org/10.1109/fuzz-ieee55066.2022.9882760.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Peng, Huibiao Zhu, Shengchao Qin, Phillip J. Brooke, and Xi Wu. "Linking Algebraic Semantics and Operational Semantics for Web Services Using Maude." In 2013 18th International Conference on Engineering of Complex Computer Systems (ICECCS). IEEE, 2013. http://dx.doi.org/10.1109/iceccs.2013.46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hatano, Ryo, Katsuhiko Sano, and Satoshi Tojo. "Linear Algebraic Semantics for Multi-agent Communication." In International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and and Technology Publications, 2015. http://dx.doi.org/10.5220/0005219001740181.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xiao, Lili, Huibiao Zhu, Mengda He, and Shengchao Qin. "Algebraic Semantics for C++11 Memory Model." In 2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC). IEEE, 2022. http://dx.doi.org/10.1109/compsac54236.2022.00240.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algebraic semantics"

1

Obua, Steven. Abstraction Logic. Steven Obua (as Recursive Mind), October 2021. http://dx.doi.org/10.47757/abstraction.logic.1.

Full text
Abstract:
Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of first-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that first-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between first-order logic and second-order logic. It is sound and complete with respect to an intuitive and simple algebraic semantics.
APA, Harvard, Vancouver, ISO, and other styles
2

Obua, Steven. Abstraction Logic. Recursive Mind, November 2021. http://dx.doi.org/10.47757/abstraction.logic.2.

Full text
Abstract:
Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of first-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that first-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between first-order logic and second-order logic. It is sound with respect to an intuitive and simple algebraic semantics. Completeness holds for both intuitionistic and classical abstraction logic, and all abstraction logics in between and beyond.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algebraic semantics' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography