Results 31 to 40 of about 8,375 (166)
Meaning and Reference in Programming Languages
PhilosophiesThis paper provides an analysis of the meaning–reference problem, as traditionally advanced in the philosophy of language, for imperative programming languages.
Nicola Angius
doaj +1 more source
On the Future of Information: Reunification, Computability, Adaptation, Cybersecurity, Semantics
IEEE Access, 2016 The vulnerability of software and the Internet and the accumulation of unprocessed information in big data are serious problems in informatics. Both are human-related. The former was traced to flaws caused by human interventions in development.
Sergio Pissanetzky
doaj +1 more source
MiniAgda: Integrating Sized and Dependent Types [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make termination ...
Andreas Abel
doaj +1 more source
Confluence for classical logic through the distinction between values and computations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We apply an idea originated in the theory of programming languages - monadic meta-language with a distinction between values and computations - in the design of a calculus of cut-elimination for classical logic.
José Espírito Santo +3 more
doaj +1 more source
Sharing a Library between Proof Assistants: Reaching out to the HOL Family [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We observe today a large diversity of proof systems. This diversity has the negative consequence that a lot of theorems are proved many times. Unlike programming languages, it is difficult for these systems to co-operate because they do not implement the
François Thiré
doaj +1 more source
Towards a theory of semantics and compilers for programming languages
Journal of Computer and System Sciences, 1969 The concept of imbedding a programming language L into a formal system is introduced and used as the basis of defining the semantics Θ of the language. Θ is an operator which maps a program p in L onto a function. The pair (L, Θ) is called a programming system.
openaire +2 more sources
Operational Domain Theory and Topology of a Sequential Programming Language
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martín Hötzel Escardó, Weng Kin Ho
openaire +3 more sources
Synthesizing theories of human language with Bayesian program induction
Nature Communications, 2022 AbstractAutomated, data-driven construction and evaluation of scientific models and theories is a long-standing challenge in artificial intelligence. We present a framework for algorithmically synthesizing models of a basic part of human language: morpho-phonology, the system that builds word forms from sounds.
Kevin Ellis +4 more
openaire +4 more sources
On the Semantics of Hybrid ASP Systems Based on Clingo
Algorithms, 2023 Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems.
Pedro Cabalar +3 more
doaj +1 more source
Consistent and complementary formal theories of the semantics of programming languages
Acta Informatica, 1974 This paper presents a comparative study of different methods for formal description of programming languages. These methods have been applied to a simple but realistically usable programming language; the more abstract definitions have been proved to be consistent relative to the more concrete ones.
Hoare, C, Lauer, P
openaire +3 more sources