Results 41 to 50 of about 8,375 (166)
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
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
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
Using Category Theory to Design Programming Languages [PDF]
, 2009 In a 1980 paper entitled "Using Category Theory to Design Conversions and Generic Operators", the author showed how the concepts of category theory can guide the design of a programming language to avoid anomalies in the interaction of implicit conversions and generic operators.
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
Programming Language Semantics in Foundational Type Theory [PDF]
, 1998 There are compelling benefits to using foundational type theory as a framework for programming language semantics. I give a semantics of an expressive programming calculus in the foundational type theory of Nuprl. Previous type-theoretic semantics have used less expressive type theories, or have sacrificed important programming constructs such as ...
openaire +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
A Declarative Agent Programming Language Based on Action Theories
, 2009 We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between the specification of the agent’s strategic behavior and the underlying theory about the agent’s actions and their effects.
Conrad Drescher +2 more
openaire +3 more sources
Explicit substitions and all that
Revista Colombiana de Computación, 2000 Explicit substitution calculi are extensions of the calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming ...
Mauricio Ayala Rincón, César Muñoz
doaj