Results 81 to 90 of about 228,658 (258)
QRB-Domains and the Probabilistic Powerdomain [PDF]
Logical Methods in Computer Science, 2012 Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj +1 more source
A static cost analysis for a higher-order language [PDF]
, 2012 We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential.
Danner, N., Paykin, J., Royer, J. S.
core +1 more source
In defense of value incomparability: A reply to Dorr, Nebel, and Zuehl
Noûs, EarlyView.Abstract Cian Dorr, Jacob Nebel, and Jake Zuehl have argued that no objects are incomparable in value. One set of arguments they offer depart from a principle they call ‘Strong Monotonicity’, which states that if x is good and y is not good, then x is better than y.
Erik Carlson, Olle Risberg
wiley +1 more source
Verification of Control System Runtime Using an Executable Semantic Model
AlgorithmsThe paper outlines a methodology for validating the accuracy of a control system’s runtime implementation. The runtime takes the form of a virtual machine executing portable code compliant with IEC 61131-3 standards.
Jan Sadolewski, Bartosz Trybus
doaj +1 more source
A proof-theoretic view on scheduling in concurrency [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non ...
Emmanuel Beffara
doaj +1 more source
Theorem proving support in programming language semantics [PDF]
, 2007 We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system.
Bertot, Yves
core +3 more sources
Philosophical Perspectives, EarlyView.ABSTRACT This paper gives a new account of the actuality entailments of ability claims. We observe that, in the environments which give rise to the actuality entailment, ability claims carry a presupposition of trying. We show that, given this presupposition, the actuality entailment is straightforwardly predicted by a conditional theory of ability. We
David Boylan, Ginger Schultheis
wiley +1 more source
Operational and denotational semantics of prolog
The Journal of Logic Programming, 1987 AbstractA Vienna Definition Language operational semantics of PROLOG, which includes the cut, the database, and the extra-logical operations, is presented. This semantics serves as the basis for deriving a denotational-continuation-style semantics of PROLOG through a systematic transformation of the operational semantics by a method described by Berry.
Bijan Arbab, Daniel M. Berry
openaire +2 more sources
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus.
Giulio Guerrieri
doaj +1 more source
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
, 2014 We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.
Bistarelli, Stefano +3 more
core +1 more source