Log in

Relevant bibliographies by topics / Denotational semantic

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Denotational semantic'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'Denotational semantic.'

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 "Denotational semantic"

1

Young, Peter, Alice Lai, Micah Hodosh, and Julia Hockenmaier. "From image descriptions to visual denotations: New similarity metrics for semantic inference over event descriptions." Transactions of the Association for Computational Linguistics 2 (December 2014): 67–78. http://dx.doi.org/10.1162/tacl_a_00166.

Full text

Abstract:

We propose to use the visual denotations of linguistic expressions (i.e. the set of images they describe) to define novel denotational similarity metrics, which we show to be at least as beneficial as distributional similarities for two tasks that require semantic inference. To compute these denotational similarities, we construct a denotation graph, i.e. a subsumption hierarchy over constituents and their denotations, based on a large corpus of 30K images and 150K descriptive captions.

APA, Harvard, Vancouver, ISO, and other styles

2

Iurato, Giuseppe. "Eye Movement Pre-Algebra and Visual Semantic Algebra." International Journal of Cognitive Informatics and Natural Intelligence 13, no. 1 (January 2019): 62–72. http://dx.doi.org/10.4018/ijcini.2019010105.

Full text

Abstract:

This article proposes a new denotational mathematics entity, i.e., the eye movement pre-algebra (EMpA), which may be considered as a pre-algebraic structure in a certain sense generating, according to universal algebra, Husserlian phenomenological theory and structuralism, another basic algebraic structure of denotational mathematics, said to be visual semantic algebra (VSA).

APA, Harvard, Vancouver, ISO, and other styles

3

GUO, MINYI. "DENOTATIONAL SEMANTICS OF AN HPF-LIKE DATA-PARALLEL LANGUAGE MODEL." Parallel Processing Letters 11, no. 02n03 (June 2001): 363–74. http://dx.doi.org/10.1142/s0129626401000658.

Full text

Abstract:

It is important for programmers to understand the semantics of a programming language. However, little work has been done about the semantic descriptions of HPF-like data-parallel languages. In this paper, we first define a simple language [Formula: see text], which includes the principal facilities of a data-parallel language such as HPF. Then we present a denotational semantic model of [Formula: see text]. It is useful for understanding the components of an HPF-like language, such as data alignment and distribution directives, forall data-parallel statements.

APA, Harvard, Vancouver, ISO, and other styles

4

WANG, YINGXU. "ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING." International Journal of Semantic Computing 04, no. 02 (June 2010): 203–37. http://dx.doi.org/10.1142/s1793351x10000833.

Full text

Abstract:

Semantics is the meaning of symbols, notations, concepts, functions, and behaviors, as well as their relations that can be deduced onto a set of predefined entities and/or known concepts. Semantic computing is an emerging computational methodology that models and implements computational structures and behaviors at semantic or knowledge level beyond that of symbolic data. In semantic computing, formal semantics can be classified into the categories of to be, to have, and to do semantics. This paper presents a comprehensive survey of formal and cognitive semantics for semantic computing in the fields of computational linguistics, software science, computational intelligence, cognitive computing, and denotational mathematics. A set of novel formal semantics, such as deductive semantics, concept-algebra-based semantics, and visual semantics, is introduced that forms a theoretical and cognitive foundation for semantic computing. Applications of formal semantics in semantic computing are presented in case studies on semantic cognition of natural languages, semantic analyses of computing behaviors, behavioral semantics of human cognitive processes, and visual semantic algebra for image and visual object manipulations.

APA, Harvard, Vancouver, ISO, and other styles

5

GABOARDI, MARCO, LUCA PAOLINI, and MAURO PICCOLO. "On the reification of semantic linearity." Mathematical Structures in Computer Science 26, no. 5 (November 10, 2014): 829–67. http://dx.doi.org/10.1017/s0960129514000401.

Full text

Abstract:

Linearity is a multi-faceted and ubiquitous notion in the analysis and development of programming language concepts. We study linearity in a denotational perspective by picking out programs that correspond to linear functions between domains.We propose a PCF-like language imposing linear constraints on the use of variable to program only linear functions. To entail a full abstraction result, we introduce some higher-order operators related to exception handling and parallel evaluation. We study several notions of operational equivalence and show them to coincide with our language. Finally, we present a new operational evaluation of the language that provides the base for a real implementation. It exploits the denotational linearity to provide an efficient evaluation semantics SECD-like, that avoids the use of closures.

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Yingxu, Yousheng Tian, and Kendal Hu. "Semantic Manipulations and Formal Ontology for Machine Learning based on Concept Algebra." International Journal of Cognitive Informatics and Natural Intelligence 5, no. 3 (July 2011): 1–29. http://dx.doi.org/10.4018/ijcini.2011070101.

Full text

Abstract:

Towards the formalization of ontological methodologies for dynamic machine learning and semantic analyses, a new form of denotational mathematics known as concept algebra is introduced. Concept Algebra (CA) is a denotational mathematical structure for formal knowledge representation and manipulation in machine learning and cognitive computing. CA provides a rigorous knowledge modeling and processing tool, which extends the informal, static, and application-specific ontological technologies to a formal, dynamic, and general mathematical means. An operational semantics for the calculus of CA is formally elaborated using a set of computational processes in real-time process algebra (RTPA). A case study is presented on how machines, cognitive robots, and software agents may mimic the key ability of human beings to autonomously manipulate knowledge in generic learning using CA. This work demonstrates the expressive power and a wide range of applications of CA for both humans and machines in cognitive computing, semantic computing, machine learning, and computational intelligence.

APA, Harvard, Vancouver, ISO, and other styles

7

POWER, JOHN, and EDMUND ROBINSON. "Premonoidal categories and notions of computation." Mathematical Structures in Computer Science 7, no. 5 (October 1997): 453–68. http://dx.doi.org/10.1017/s0960129597002375.

Full text

Abstract:

We introduce the notions of premonoidal category and premonoidal functor, and show how these can be used in the denotational semantics of programming languages. We characterize the semantic definitions of Eugenio Moggi's monads as notions of computation, exhibit a representation theorem for our premonoidal setting in terms of monads, and give a fibrational setting for the structure.

APA, Harvard, Vancouver, ISO, and other styles

8

Maldjieva, Viara. "Semantic motivation for the denotational identity of arguments in predication structures." Cognitive Studies | Études cognitives, no. 10 (November 24, 2015): 111–19. http://dx.doi.org/10.11649/cs.2010.005.

Full text

Abstract:

Semantic motivation for the denotational identity of arguments in predication structuresThis text is an attempt at a preliminary outline of the factors that motivate the denotational identity of argument content in the predication structure as well as the consequences of this identity for the shape of the sentence expression which is a realization of such a structure.The first question this analysis attempts to answer concerns the structure of predicative concepts that constitute the predication structure with arguments of the identical content?The second question the cursory analysis done attempts to answer concerns the manner, in which the identity existing on the semantic structure level is signaled on the surface, in the formal structure.

APA, Harvard, Vancouver, ISO, and other styles

9

Jäkel, Olaf. "Denotational Incongruencies in TEFL: Cognitive linguistic solutions for a didactic problem." Yearbook of the German Cognitive Linguistics Association 7, no. 1 (November 26, 2019): 67–78. http://dx.doi.org/10.1515/gcla-2019-0005.

Full text

Abstract:

Abstract Denotational incongruencies as a contrastive phenomenon of lexical-semantic analyses have been described in various respects in Cognitive Linguistics (Jäkel 2001, 2003, 2010a, 2014). This contribution based on authentic evidence from the Flensburg English Classroom Corpus (FLECC) (Jäkel 2010b) is going to demonstrate that and how denotational incongruencies also affect foreign language teaching by creating problems of intercultural misunderstanding. The proposed approach to their comparative analysis can hopefully provide solutions. Thus, German “Bitte” is not always English “Please”, just as “Seid ihr fertig?” does not always translate as “Are you ready?” It will be argued that and why the common label of false friends is insufficient in this context. Especially the types of granularity differential and even crosspiece incongruencies pose a didactic problem for teachers whose origin needs to be recognized. First of all, the cognitive field-semantic analysis contributes to a differentiated recognition by the teacher. In a next step, cognitive linguistics can contribute motivated solutions for TEFL and its teaching methodology. In sum, this makes for a two-stage consciousness raising enterprise: Teachers realize in how far denotational incongruencies interfere in their pupils’ foreign language learning. And they find appropriate methods to make their pupils aware of concrete cases of denotational incongruencies – an important ingredient for promoting intercultural communicative competence in foreign language teaching.

APA, Harvard, Vancouver, ISO, and other styles

10

Jäkel, Olaf. "Denotational boundary disputes in political discourse." Cognitive Perspectives on Political Discourse 13, no. 2 (August 20, 2014): 336–63. http://dx.doi.org/10.1075/jlp.13.2.07jak.

Full text

Abstract:

The cognitive semantic analysis of denotational incongruencies by means of comparative investigations of structural field patterns (cf. Jäkel 2001, 2003, 2010) can also be put to use in the investigation of certain kinds of contested concepts (Lakoff 1993), namely cases in which the field patterns themselves are under dispute. The case to be analysed is that of marriage, a cultural concept that has recently come under dispute in the socio-political discourse of Western countries. Competing cultural models (cf. Lakoff 1987) to be compared in this context include the traditional/conservative model as well as different versions of a more tolerant model and a liberal/progressive model. The analysis will focus on authentic language data from the United States, Canada, Great Britain, and Germany, supplemented by a diachronic comparison of dictionary definitions as well as the results of a survey done with young German informants.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Denotational semantic"

1

Bryans, Jeremy William. "Denotational semantic models for real-time LOTOS." Thesis, University of Reading, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

Gouy, Xavier. "Etude des théories équationelles et des propriétés algébriques des modèles stables du Lambda-calcul." Paris 7, 1995. http://www.theses.fr/1995PA077203.

Full text

Abstract:

Ce travail est principalement consacre a l'etude des modeles stables du lambda-calcul pur. Il vise a situer cette classe de modeles par rapport a celle des modeles continus, de facon a mettre en evidence les ameliorations que la stabilite apporte a la modelisation du lambda-calcul pur. Pour ce faire, nous avons etudie les modeles du double point de vue de leur theorie equationnelle et de leurs proprietes algebriques. Nous presentons d'abord une classe abstraite de semantiques (les categories cartesiennes closes regulieres), qui contient les semantiques continue, stable et fortement stable, et nous montrons que dans ce cadre, tout modele analogue au modele de scott a la meme theorie equationnelle que ce dernier. Nous montrons qu'en revanche le modele de park et son analogue stable ont des theories differentes. Nous montrons ensuite que la classe des modeles stables est incomplete. Enfin, nous montrons que tout di-domaine reflexif contient un di-domaine de retractions universelles

APA, Harvard, Vancouver, ISO, and other styles

4

Ruoppolo, Domenico. "Relational graph models and Morris's observability : resource-sensitive semantic investigations on the untyped λ-calculus." Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCD069/document.

Full text

Abstract:

La thèse contribue à l’étude du λ-calcul non-typé de Church, un système de réécriture dont la règle principale est la β-réduction (formalisant l’exécution d’un programme). Nous nous concentrons sur la sémantique dénotationnelle, l’étude de modèles du λ-calcul interprétant de la même façon les λ-termes β-convertibles. On examine la sémantique relationnelle, une sémantique sensible aux ressources qui interprète les λ-termes comme des relations avec les entrées regroupées en multi-ensembles. Nous définissons une classe de modèles relationnels, les modèles de graphe relationnels (rgm’s), que nous étudions avec une approche issue de la théorie des types et de la démonstration, par le biais de certains systèmes de types avec intersection non-idémpotente. D’abord, nous découvrons la plus petite et la plus grande λ–théorie (théorie équationnelle étendant la β-conversion) représentées dans la classe. Ensuite, nous utilisons les rgm’s afin de résoudre le problème de l’adéquation complète pour la λ–théorie observationnelle de Morris, à savoir l’équivalence contextuelle de programmes que l’on obtient lorsqu’on prend les β-formes normales comme sorties observables. On résoudre le problème de différentes façons. En caractérisant la β-normalisabilité avec les types, nous découvrons une infinité de rgm’s complètement adéquats, que nous appelons uniformément sans fond. Puis, nous résolvons le problème de façon exhaustive, en prouvant qu’un rgm est complètement adéquat pour l’observabilité de Morris si et seulement si il est extensionnel (il modèle l’ŋ-conversion) et λ-König. Moralement un rgm est λ-König si tout arbre récursif infini a une branche infinie témoignée par un type non-bien-fondé
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem having the β-reduction (the formal counterpart of the idea of execution of programs) asmain rule. The focus is on denotational semantics, namely the investigation of mathematical models of the λ-calculus giving the same denotation to β-convertible λ-terms. We investigate relational semantics, a resource-sensitive semantics interpreting λ-terms as relations,with their inputs grouped together in multisets. We define a large class of relational models,called relational graph models (rgm’s), and we study them in a type/proof-theoretical way, using some non-idempotent intersection type systems. Firstly, we find the minimal and maximal λ-theories (equational theories extending -conversion) represented by the class.Then we use rgm’s to solve the full abstraction problem for Morris’s observational λ-theory,the contextual equivalence of programs that one gets by taking the β-normal forms asobservable outputs. We solve the problem in different ways. Through a type-theoretical characterization of β-normalizability, we find infinitely many fully abstract rgm’s, that wecall uniformly bottomless.We then give an exhaustive answer to the problem, by showing thatan rgm is fully abstract for Morris’s observability if and only if it is extensional (a model of ŋ-conversion) and λ-König. Intuitively an rgm is λ-König when every infinite computable tree has an infinite branch witnessed by some type of the model, where the witnessing is a property of non-well-foundedness on the type

APA, Harvard, Vancouver, ISO, and other styles

5

MARANHÃO, Heitor Paceli. "Program synthesis from denotational semantics." Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/20828.

Full text

Abstract:

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2017-08-23T12:57:53Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Dissertacao_Heitor_Maranhao.pdf: 1117044 bytes, checksum: ceea86d5a4dad585b8f79f5f79278656 (MD5)
Made available in DSpace on 2017-08-23T12:57:53Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Dissertacao_Heitor_Maranhao.pdf: 1117044 bytes, checksum: ceea86d5a4dad585b8f79f5f79278656 (MD5) Previous issue date: 2016-09-13
Program synthesis aims to automate the task of programming. Through program synthesis it is possible to let the programmer free to care about the description (specification) of the problem to be solved by the program under development, reducing human interaction with coding tasks. Automating new algorithms creation and transferring responsibility for writing code are some of the benefits propitiated by program synthesis. In this work, program synthesis is presented as an Alloy* specification for an imperative language. We synthesize programs described by pre and post-conditions (contracts) written using a Domain Specific Language proposed in this work. We embed the syntax and the denotational semantics of Winskel’s imperative language in Alloy*. Alloy* has proven to be an easy and productive way of building program synthesizers. Our experiments show that synthesis based on Alloy* is competitive once contracts, scopes and, if needed, sketches, are correctly chosen. As a consequence, our Alloy* program synthesizer can provide, in a single high-level framework, different features in comparison to other synthesizers: (i) synthesis based on scope; (ii) synthesis based on sketches; and (iii) verification. We introduce our Domain Specific Language for contracts and present a detailed description on the synthesis of the swap problem, the product of two numbers, the maximum of 2 and of 3 numbers, and the greatest common divisor. Another contribution of this work is a source code generator, using the programming language C#, of the algorithms created by our synthesizer.
Síntese de programas permite automatizar as atividades de programação. Através desta automação é possível deixar o programador livre para criar a descrição (especificação) do problema que o programa a ser desenvolvido busca resolver, reduzindo a interação humana com a etapa de escrita de código. Automatizar criação de novos algoritmos e transferir para máquinas a responsabilidade de escrever o código de programas são alguns dos benefícios que a síntese de programas possibilita. Neste trabalho, síntese de programas é apresentada através de uma especificação em Alloy* usando uma linguagem imperativa. A síntese é realizada a partir de um par de predicados, pré e pós-condição (contrato), escritos usando uma linguagem de domínio específico proposta neste trabalho. A semântica denotacional da linguagem imperativa usada por Winskel foi embutida em Alloy*. O uso de Alloy* se mostrou uma maneira fácil e produtiva de construir sintetizadores de programas. Os experimentos mostram que síntese baseada em Alloy* é competitiva, uma vez que contratos, escopos e, se necessário, esboços, sejam corretamente escolhidos. Como consequência, o sintetizador de programas em Alloy* pode fornecer, em um único framework de alto nível, características diferentes em comparação com outros sintetizadores: (i) síntese baseada em escopo; (ii) síntese baseada em esboços; e (iii) verificação. Para demonstrar a aplicabilidade prática de nosso trabalho, usamos nossa ferramenta na síntese de problemas clássicos da Computação, tais como troca do valor entre duas variáveis, o produto de dois números, o máximo de 2 e 3 números, e o maior divisor comum entre dois números. Outra contribuição deste trabalho consiste em um gerador de código na linguagem de programação C#, dos algoritmos criados pelo nosso sintetizador.

APA, Harvard, Vancouver, ISO, and other styles

6

Bialkiewicz, Joël-Alexis. "Towards a denotational semantics for mobility." Paris 6, 2011. http://www.theses.fr/2011PA066007.

Full text

Abstract:

La sémantique des systèmes concurrents a été largement étudiée. Même si plusieurs pistes ont été explorées, il y a deux écoles de pensée en la matière. La première promeut le pi-calcul, une algèbre de processus définie en étendant son ancêtre CCS. Son point de vue sémantique est opérationnel, étant donné que les processus sont représentés comme des systèmes de transitions étiquetées. Son avantage principale est qu'il permet de représenter la mobilité, c'est-à-dire la capacité des processus à changer de voisins, de façon intuitive. Ceci est possible en permettant à la portée des canaux de varier. La seconde approche repose sur CSP, une algèbre de processus qui est construite du point de vue dénotationnel, en tant qu'un langage concurrent à passage de valeurs dont les processus sont représentés dans un système de traces ensemblistes qui a été étendu année après année. Même si CSP ne gère pas nativement la mobilité, il a été récemment montré qu'il est suffisamment expressif pour encoder le pi-calcul. Le but principal de cette thèse était et est toujours de construire un pont entre les deux mondes, en apportant une algèbre de processus qui soit à la fois intégralement mobile comme le pi-calcul, avec toute l'expressivité de la portée dynamique des canaux, mais aussi intégralement dénotationnelle comme CSP, avec une dénotation ensembliste définie pour chaque processus en lieu et place d'une caractérisation opérationnelle. Afin de conserver l'expressivité complète du pi-calcul, une partie de sa syntaxe et de ses constructions ont dû être conservées, spécifiquement son concept de restriction de portée qui, avec la possibilité d'envoyer des canaux à portée réduite à travers des canaux publics, permet de rendre la portée des canaux intégralement dynamique. Ces constructions, qui sont nécessaires pour la véritable mobilité, ne sont toutefois pas compatibles avec le concept d'échecs et de divergences hérité de CSP, dans la mesure où il impose qu'un nom de canal ait le même sens d'un bout à l'autre d'une trace d'exécution. Ceci a imposé de repenser le concept de traces étendues et d'introduire des localisations afin de lier chaque observation au potentiel du processus de permettre de nouvelles interactions à ce niveau, non pas à travers des ensembles de refus mais plutôt en utilisant une identification spatiale unique du nœud correspondant dans la structure de branchement du processus. Les contributions de la thèse sont les suivantes. D'abord, une algèbre de processus qui est d'une certaine façon un hybride entre le pi-calcul et CSP, et est à la fois dénotationnelle, compositionnelle et mobile est introduite. Elle est dénotationnelle parce que toute expression de processus peut être traduite en un modèle ensembliste sans perte d'information. Elle est compositionnelle parce que ces modèles peuvent être combinés sans tenir compte du contexte, et une relation d'équivalence indépendante du contexte a pu être conçue. Elle est mobile parce qu'elle partage la totalité des propriétés mobiles du pi-calcul, non seulement le passage de canaux mais aussi l'extrusion de portée. Ensuite, une sémantique axiomatique est également fournie, et il est prouvé qu'elle est correcte et complète pour la partie finie du langage. En raison de ses propriétés, l'algèbre de processus se comporte avec élégance vis-à-vis de l'opérateur de mismatch, ce qui n'est pas une évidence pour de nombreuses versions du pi-calcul. De plus, une théorie du raffinement est proposée pour le langage. Même si elle reste perfectible, c'est inédit dans le monde de la mobilité. Enfin, une logique dénotationnelle a été conçue en suivant en cela l'exemple de CSP.

APA, Harvard, Vancouver, ISO, and other styles

7

Cunha, Joao Bernardo de Sena Esteves Falcao e. "Denotational semantics in the definition of natural language uses." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/47834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ekembe, Ngondi Gerard. "Denotational semantics of mobility in Unifying Theories of Programming (UTP)." Thesis, University of York, 2016. http://etheses.whiterose.ac.uk/16525/.

Full text

Abstract:

UTP promotes the unification of programming theories and has been used successfully for giving denotational semantics to Imperative Programming, CSP process algebra, and the Circus family of programming languages, amongst others. In this thesis, we present an extension of UTP-CSP (the UTP semantics for CSP) with the concept of mobility. Mobility is concerned with the movement of an entity from one location (the source) to another (the target). We deal with two forms of mobility: • Channel mobility, concerned with the movement of links between processes, models networks with a dynamic topology; and • Strong process mobility, which requires to suspend a running process first, and then move both its code and its state upon suspension, and finally resume the process on the target upon reception. Concerning channel mobility: • We model channels as concrete entities in CSP, and show that it does not affect the underlying CSP semantics. • A requirement is that a process may not own a channel prior to receiving it. In CSP, the set of channels owned by a process (called its interface) is static by definition. We argue that making the interface variable introduces a paradox. We resolve this by introducing a new concept: the capability of a process, and show how it relates to the interface. We then define channel mobility as the operation that changes the interface of a process, but not its capability. We also provide a functional link between static CSP and its mobile version. Concerning strong mobility, we provide: • The first extension of CSP with jump features, using the concept of continuations. • A novel semantics for the generic interrupt (a parallel-based interrupt operator), using the concept of Bulk Synchronous Parallelism. We then define strong mobility as a specific interrupt operator in which the interrupt routine migrates the suspended program.

APA, Harvard, Vancouver, ISO, and other styles

9

Brown, Simon Ambrose. "The semantics of database query languages." Thesis, University of Sheffield, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310781.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Buth, Karl-Heinz [Verfasser]. "Techniques for Modelling Structured Operational and Denotational Semantics Definitions with Term Rewriting Systems / Karl Heinz Buth." Kiel : Universitätsbibliothek Kiel, 1994. http://d-nb.info/1080332669/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Denotational semantic"

1

Blikle, Andrzej. Why denotational?: Remarks on applied denotational semantics. Warszawa: Instytut Podstaw Informatyki Polskiej Akademii Nauk, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cook, William R. A denotational semantics of inheritance. Ann Arbor: University Microfilms International, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

A practical introduction to denotational semantics. Cambridge [Cambridgeshire]: Cambridge University Press, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Arbab, B. Operational and denotational semantics of PROLOG. Los Angeles: IBM Scientific Center, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Denotational semantics: A methodology for language development. Dubuque, Iowa: Wm.C. Brown, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schmidt, DavidA. Denotational semantics: A methodology for language development. Boston (Mass.): Allyn and Bacon, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Schmidt, David A. Denotational semantics: A methodology for language development. Boston: Allyn and Bacon, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Blikle, Andrzej. MetaSoft primer: Towards a metalanguage for applied denotational semantics. Berlin: Springer-Verlag, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

MetaSoft primer: Towards a metalanguage for applied denotational semantics. Berlin: Springer-Verlag, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pullum, Geoffrey K. Slurs and Obscenities. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198758655.003.0009.

Full text

Abstract:

Words are often assumed to have denotations linking them to concepts, and we use a word with a certain denotation when we want to convey to our interlocutor the concept to which it is linked. Obscene swearwords and offensive slurs reveal the simplistic character of this view. Issues of style, tone, esthetics, etiquette, attitude, and self-presentation arise; semantics, pragmatics, sociolinguistics, and anthropology are involved in clarifying them. After surveying some semantic and pragmatic preliminaries, the chapter delves into the lexicography of obscene and offensive terms. There are some flagrant semantic errors in trusted dictionaries. Experienced lexicographers get many simple meanings badly and obviously wrong. Part of the explanation may lie in a desire to distance the dictionary’s authority from the pejorative content. Correcting such entries involves recognizing that words have nonlinguistic properties as well as linguistic ones.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Denotational semantic"

1

Misra, Jayadev. "A Denotational Semantic Theory of Concurrent Systems." In Lecture Notes in Computer Science, 493–518. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23165-5_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nipkow, Tobias, and Gerwin Klein. "Denotational Semantics." In Concrete Semantics, 179–90. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10542-0_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mamouras, Konstantinos. "Semantic Foundations for Deterministic Dataflow and Stream Processing." In Programming Languages and Systems, 394–427. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_15.

Full text

Abstract:

AbstractWe propose a denotational semantic framework for deterministic dataflow and stream processing that encompasses a variety of existing streaming models. Our proposal is based on the idea that data streams, stream transformations, and stream-processing programs should be classified using types. The type of a data stream is captured formally by a monoid, an algebraic structure with a distinguished binary operation and a unit. The elements of a monoid model the finite fragments of a stream, the binary operation represents the concatenation of stream fragments, and the unit is the empty fragment. Stream transformations are modeled using monotone functions on streams, which we call stream transductions. These functions can be implemented using abstract machines with a potentially infinite state space, which we call stream transducers. This abstract typed framework of stream transductions and transducers can be used to (1) verify the correctness of streaming computations, that is, that an implementation adheres to the desired behavior, (2) prove the soundness of optimizing transformations, e.g. for parallelization and distribution, and (3) inform the design of programming models and query languages for stream processing. In particular, we show that several useful combinators can be supported by the full class of stream transductions and transducers: serial composition, parallel composition, and feedback composition.

APA, Harvard, Vancouver, ISO, and other styles

4

Péchoux, Romain, Simon Perdrix, Mathys Rennela, and Vladimir Zamdzhiev. "Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory." In Lecture Notes in Computer Science, 562–81. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_29.

Full text

Abstract:

AbstractInductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL. We construct a sound categorical model for the language and by doing so we provide the first detailed semantic treatment of user-defined inductive datatypes in quantum programming. We also show our denotational interpretation is invariant with respect to big-step reduction, thereby establishing another novel result for quantum programming. Compared to classical programming, this property is considerably more difficult to prove and we demonstrate its usefulness by showing how it immediately implies computational adequacy at all types. To further cement our results, our semantics is entirely based on a physically natural model of von Neumann algebras, which are mathematical structures used by physicists to study quantum mechanics.

APA, Harvard, Vancouver, ISO, and other styles

5

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

6

Draheim, Dirk. "Denotational Semantics." In Semantics of the Probabilistic Typed Lambda Calculus, 135–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-642-55198-7_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Loeckx, Jacques, and Kurt Sieber. "Denotational Semantics." In Series in Computer Science, 92–110. Wiesbaden: Vieweg+Teubner Verlag, 1987. http://dx.doi.org/10.1007/978-3-322-96753-4_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gergely, Tamás, and László Úry. "Continuous Denotational Semantics." In First-Order Programming Theories, 179–210. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58205-9_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gergely, Tamás, and László Úry. "Definable Denotational Semantics." In First-Order Programming Theories, 211–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58205-9_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Roscoe, A. W. "Denotational semantics for occam." In Lecture Notes in Computer Science, 306–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15670-4_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Denotational semantic"

1

Lai, Alice, and Julia Hockenmaier. "Illinois-LH: A Denotational and Distributional Approach to Semantics." In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014). Stroudsburg, PA, USA: Association for Computational Linguistics, 2014. http://dx.doi.org/10.3115/v1/s14-2055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yahyaoui, Hamdi, Mourad Debbabi, and Nadia Tawbi. "A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL." In Seventh International Conference on Quality Software (QSIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/qsic.2007.4385519.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Frost, Richard A., Bryan St Amour, and Randy Fortier. "An Event Based Denotational Semantics for Natural Language Queries to Data Represented in Triple Stores." In 2013 IEEE Seventh International Conference on Semantic Computing (ICSC). IEEE, 2013. http://dx.doi.org/10.1109/icsc.2013.33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Riddle, Steve M., and Peter J. L. Wallis. "Denotational Semantics and Refinement." In Proceedings of the 1st Irish Workshop on Formal Methods. BCS Learning & Development, 1997. http://dx.doi.org/10.14236/ewic/fm1997.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Slonneger, Ken. "Denotational semantics of a calculator." In the 1993 ACM conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/170791.170826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hamon, Grégoire. "A denotational semantics for stateflow." In the 5th ACM international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1086228.1086260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Slonneger, Ken. "An exercise in denotational semantics." In the twenty-second SIGCSE technical symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/107004.107036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

de Boer, F. S., M. Gabbrielli, and M. C. Meo. "A denotational semantics for Timed Linda." In the 3rd ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/773184.773188.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Guerin, Frank, and Jeremy Pitt. "Denotational semantics for agent communication language." In the fifth international conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/375735.376427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Slonneger, Ken. "Implementing denotational semantics with logic programming." In the 1992 ACM annual conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/131214.131257.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Denotational semantic"

1

Gunter, Carl A., Peter D. Mosses, and Dana S. Scott. Semantic Domains and Denotational Semantics. Fort Belvoir, VA: Defense Technical Information Center, February 1989. http://dx.doi.org/10.21236/ada220285.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cook, J. V. The Language for DENOTE (Denotational Semantics Translation Environment). Fort Belvoir, VA: Defense Technical Information Center, August 1990. http://dx.doi.org/10.21236/ada237144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!