Results 51 to 60 of about 11,408 (204)
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
Linear Haskell: practical linearity in a higher-order polymorphic language [PDF]
, 2017 Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards ...
Bernardy, Jean-Philippe +4 more
core +3 more sources
Journal of the Royal Anthropological Institute, EarlyView.This essay introduces the themed cluster of articles, ‘Towards a linguistic anthropology of AI’. The advent of artificial intelligence (AI), especially in large language models capable of producing coherent discourse mimicking conversational interaction, is exerting unprecedented pressure on prevailing concepts of language, personhood, and the human ...
Webb Keane, Constantine V. Nakassis
wiley +1 more source
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
Journal of the Royal Anthropological Institute, EarlyView.What does it take to turn a tool into a talking tool and that into an ultimate authority? Generative artificial intelligence (GenAI) in its diverse forms, such as large language models (LLMs), is celebrated as a useful tool. But LLM‐based conversational agents, or chatbots, the software applications through which ordinary users are likely to engage ...
Webb Keane
wiley +1 more source
Treo: Textual Syntax for Reo Connectors [PDF]
, 2018 Reo is an interaction-centric model of concurrency for compositional specification of communication and coordination protocols. Formal verification tools exist to ensure correctness and compliance of protocols specified in Reo, which can readily be (re ...
Arbab, Farhad, Dokter, Kasper
core +3 more sources
Modern Theology, EarlyView.Abstract Examining work by Rowan Williams, this essay explores what he often refers to as the ‘difficulty’ of writing theology. The difficulty of theology lies in engaging the ruse of having ultimate answers to ultimate questions. The stakes are high: ‘God‐talk’ must concern itself with truth, with reality.
Graham Ward
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
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