Displaying similar documents to “Semantics of value recursion for monadic input/output”

An abstract monadic semantics for value recursion

Eugenio Moggi, Amr Sabry (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works uniformly for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics and does not rely on assignments. When contrasted to the axiomatic approach proposed by Erkök...

Encoding fix in object calculi

Roy L. Crole (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

A logic-based environment for developing natural language processing applications

Gérard Milhaud, Élisabeth Godbert (1998)

Mathématiques et Sciences Humaines

Similarity:

We present a system providing a set of tools for developing natural language processing (NLP) applications such as natural language interfaces, communication aid systems, etc. This system is based on two principles: modularity of knowledge representation to ensure the portability of the system, and guided sentence composition to ensure transparency, i.e. to ensure that the produced sentences are well-formed at the lexical, syntactic, semantic and conceptual levels. We first describe...

Dynamic overloading with copy semantics in object-oriented languages: a formal account

Lorenzo Bettini, Sara Capecchi, Betti Venneri (2009)

RAIRO - Theoretical Informatics and Applications

Similarity:

Mainstream object-oriented languages often fail to provide complete powerful features altogether, such as, multiple inheritance, dynamic overloading and copy semantics of inheritance. In this paper we present a core object-oriented imperative language that integrates all these features in a formal framework. We define a static type system and a translation of the language into the meta-language , in order to account for semantic issues and prove type safety of our proposal. ...

Towards specifying with inclusions.

Jaume Agustí, Jordi Puigsegur, W. Marco Schorlemmer (1997)

Mathware and Soft Computing

Similarity:

In this article we present a functional specification language based on inclusions between set expressions. Instead of computing with data individuals we deal with their classification into sets. The specification of functions and relations by means of inclusions can be considered as a generalization of the conventional algebraic specification by means of equations. The main aim of this generalization is to facilitate the incremental refinement of specifications. Furthermore, inclusional...

A Language for Compositional Programming: A Rationale and Design Език за композиционно програмиране: Обосновка и конструкция

Bantchev, Boyko (2011)

Union of Bulgarian Mathematicians

Similarity:

Бойко Бл. Банчев - Представена е обосновка и описание на език за програмиране в композиционен стил за опитни и учебни цели. Под “композиционен” имаме предвид функционален стил на програмиране, при който пресмятането е йерархия от композиции и прилагания на функции. Един от данновите типове на езика е този на геометричните фигури, които могат да бъдат получавани чрез прости правила за съотнасяне и така също образуват йерархични композиции. Езикът е силно повлиян от GeomLab, но по редица...

Mixed Theories

Radev, Slavian (2007)

Serdica Journal of Computing

Similarity:

In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in...