Results 41 to 50 of about 11,768 (185)
A Metalanguage for Guarded Iteration
, 2018 Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of guardedness in symmetric monoidal categories, which serves as a unifying ...
A Carboni +27 more
core +1 more source
Modular Composition of Language Features through Extensions of Semantic Language Models [PDF]
, 1999 Today, programming or specification languages are often extended in order to customize them for a particular application domain or to refine the language definition. The extension of a semantic model is often at the centre of such an extension.
Pahl, Claus
core +1 more source
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
Classical logic, continuation semantics and abstract machines [PDF]
, 1998 One of the goals of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines.
B. Reus +2 more
core +2 more sources
McDowell and Sellars on Objective Purport
European Journal of Philosophy, EarlyView.Abstract John McDowell has criticized Wilfrid Sellars on several occasions and over a number of years for his ‘non‐relational’ account of intentionality. This account is, according to McDowell, at least partly responsible for a ‘blind spot’ in Sellars's thinking: Sellars, allegedly, fails to see how objects or states of affairs in the external world ...
Stefan Brandt
wiley +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
The Many-Worlds Calculus [PDF]
Logical Methods in Computer ScienceIn this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice.
Kostia Chardonnet +3 more
doaj +1 more source
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
Uniquely human temporal thoughts
Mind &Language, EarlyView.Life on Earth will eventually come to an end. The thought expressed in the previous sentence is about a point in time that is not known to the individual entertaining the thought. This paper is concerned with the nature of such temporal thoughts. We propose that the capacity to mentally represent thoughts about non‐specific temporal intervals is a ...
İsa Kerem Bayırlı
wiley +1 more source
RedAlert: Determinacy Inference for Prolog [PDF]
, 2011 This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions ...
King, Andy, Kriener, Jael
core +3 more sources