Results 1 to 10 of about 174,815,442 (248)
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
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
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
On the Interpretation of Denotational Semantics
PhilosophiesThe denotational approach to the semantics of programming languages views program meanings as elements of domains, abstract partially ordered structures that form the basis of a mathematical theory of computation.
Felice Cardone
doaj +1 more source
Fundamentals of the Mathematical Programming Languages Theory
IFAC Proceedings Volumes, 1983 Abstract All operations in programming are shown to be concretizations of the universal operation (the choice operation) that is formulated in terms of tasks of finding knowledge system. The main principles for the knowledge representation system are suggested.
V.A. Tuzov, A.I. Troyan, N.V. Fotiev
openaire +1 more source
Abstract and Applied Analysis, 2013 In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification.
N. Shahzad, O. Valero
doaj +1 more source
Experience-Weighted Cognitive Complexity Metric for Software Understandability: A Cognitive-Informatics Perspective [PDF]
ITM Web of ConferencesSoftware systems are becoming increasingly complex as they evolve to meet the growing demands of modern industries. Traditional complexity metrics such as McCabe's Cyclomatic Complexity and Halstead's metrics fail to adequately capture the human ...
Idris Hadiza Salihu +3 more
doaj +1 more source
Exploring the Boundaries of Monad Tensorability on Set [PDF]
Logical Methods in Computer Science, 2013 We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component ...
Nathan Bowler +3 more
doaj +1 more source
An Overview of Data Models of Object-Oriented DBMSs
Труды Института системного программирования РАН, 2018 Object-oriented DBMS theory is one of the most prospective areas of modern database theory, along with deductive and temporal DBMS. Nevertheless, a high variety of different approaches and absence of a uniform standard, both in theoretical OODBMS area ...
A. M. Eldarkhanov
doaj