Results 41 to 50 of about 11,408 (204)
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
The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types [PDF]
Logical Methods in Computer Science, 2017 We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs.
Ranald Clouston +3 more
doaj +1 more source
A static cost analysis for a higher-order language [PDF]
, 2012 We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential.
Danner, N., Paykin, J., Royer, J. S.
core +1 more source
Monitoring distributed systems with distributed polyLarva [PDF]
, 2014 polyLarva is a language-agnostic runtime verification tool, which converts a polyLarvaScript into a monitor for a given system. While an implementation for polyLarva exists, the language and its compilation have not been formalised.
Cassar, Ian +2 more
core +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
Typing weak MSOL properties [PDF]
Logical Methods in Computer Science, 2017 We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations.
Sylvain Salvati, Igor Walukiewicz
doaj +1 more source
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
, 2014 We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.
Bistarelli, Stefano +3 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
The Sigma-Semantics: A Comprehensive Semantics for Functional Programs [PDF]
, 1996 A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every ...
Chitil, Olaf
core +4 more sources
An Experiment with Denotational Semantics [PDF]
SN Computer Science, 2019 The paper is devoted to showing how to systematically design a programming language in 'reverse order', i.e. from denotations to syntax. This construction is developed in an algebraic framework consisting of three many-sorted algebras: of denotations, of an abstract syntax and of a concrete syntax.
openaire +2 more sources