Results 221 to 230 of about 228,658 (258)
Some of the next articles are maybe not open access.
Domains for Denotational Semantics
International Colloquium on Automata, Languages and Programming, 1982The purpose of the theory of domains is to give models for spaces on which to define computable functions. The kinds of spaces needed for denotational sematics involve not only spaces of higher type (e.g. function spaces) but also spaces defined recursively (e.g. reflexive domains).
D. Scott
semanticscholar +3 more sources
The clocks they are adjunctions: Denotational semantics for Clocked Type Theory
International Conference on Formal Structures for Computation and Deduction, 2018Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract form of step ...
B. Mannaa, R. E. Møgelberg
semanticscholar +1 more source
A denotational semantics for stateflow
Proceedings of the 5th ACM international conference on Embedded software, 2005We present a denotational semantics for Stateflow, the graphical Statecharts-like language of the Matlab/Simulink toolsuite. This semantics makes use of continuations to capture even the most complex constructions of the language, such as inter-level transitions, junctions, or backtracking.
Grégoire Hamon
semanticscholar +3 more sources
Denotational semantics of concurrency
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982A general framework for the denotational treatment of concurrency is introduced. The key idea is the notion of process which is element of a domain obtained as solution of a domain equation in the style as considered previously by Plotkin. We use tools from metric topology as advocated by Nivat to solve this equation, show how operations upon processes
J. W. de Bakker, Jeffery I. Zucker
openaire +2 more sources
The denotation semantics of NIPL
ACM SIGPLAN Notices, 2001With the neurons, neural networks and rules in NIPL encapsulated as a special object, the concepts of object-oriented programming, neural network computing and logic inference have been unified, therefore, the denotation semantics of NIPL based on the theory of object-oriented is given.
Tao Li, XiaoJie Liu
openaire +2 more sources
A Denotational Semantics of Real-Time Process Algebra (RTPA)
International Journal of Cognitive Informatics and Natural Intelligence, 2008Real-time process algebra (RTPA) is a form of denotational mathematics for dealing with fundamental system behaviors such as timing, interrupt, concurrency, and event/time/interrupt-driven system dispatching.
Xinming Tan, Yingxu Wang
semanticscholar +1 more source
Proceedings Third IEEE International Workshop on Source Code Analysis and Manipulation, 2004
We show that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques.
openaire +2 more sources
We show that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques.
openaire +2 more sources
Execution time of λ-terms via denotational semantics and intersection types
Mathematical Structures in Computer Science, 2009The multiset-based relational model of linear logic induces a semantics of the untyped λ-calculus, which corresponds with a non-idempotent intersection type system, System R.
D. Carvalho
semanticscholar +1 more source
A Denotational Semantics of Solidity in Isabelle/HOL
IEEE International Conference on Software Engineering and Formal Methods, 2021Diego Marmsoler, Achim D. Brucker
semanticscholar +1 more source
2017
In this chapter we give a more abstract, purely mathematical semantics to IMP, called denotational semantics. The operational semantics is close to the memory-based, executable machine-like view: given a program and a state, we derive the state obtained after the execution of that program.
Ugo Montanari, Roberto Bruni
openaire +2 more sources
In this chapter we give a more abstract, purely mathematical semantics to IMP, called denotational semantics. The operational semantics is close to the memory-based, executable machine-like view: given a program and a state, we derive the state obtained after the execution of that program.
Ugo Montanari, Roberto Bruni
openaire +2 more sources