Results 61 to 70 of about 85,558 (251)
Denotational and operational semantics for prolog [PDF]
The Journal of Logic Programming, 1988 AbstractThe semantics of PROLOG programs is usually given in terms of the model theory of first-order logic. However, this does not adequately characterizethe computational behavior of PROLOG programs. PROLOG implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as ...
Prateek Mishra, Saumya K. Debray
openaire +1 more source
Inductive Definition and Domain Theoretic Properties of Fully Abstract [PDF]
, 2007 A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent non-deterministic ...
Luke Ong, Vladimir Sazonov
core +3 more sources
IMP with exceptions over decorated logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) effect evaluation of a term may involve.
Burak Ekici
doaj +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
Adventures in time and space [PDF]
Logical Methods in Computer Science, 2007 This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj +1 more source
How the Rejection of Incompatible Speech Acts Transforms Human Cognition
European Journal of Philosophy, EarlyView.Abstract Engaging with the literature on transformative conceptions of rationality, I argue for the following position on the way reason transforms human cognition: when the capacity for knowing that one ought to do something is directed at one's own speech acts, an initially domain‐specific and practical grasp of genus/species relations – manifest in ...
Preston Stovall
wiley +1 more source
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We define a domain-specific language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts.
Azer Bestavros, Assaf Kfoury
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
ETHICS FOR ARTIFICIAL HISTORIANS
History and Theory, EarlyView.ABSTRACT Artificial historians do not need to have intentions to complete actions or to solve problems. Consequently, a revised approach to the ethics of history is needed. An approach to ethics for artificial historians can be proposed through the recognition of historiographical logic, which is a hybrid of modal, propositional, and erotetic (question‐
Marnie Hughes‐Warrington
wiley +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