E. Moggi, An abstract view of programming languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A New Approach to Abstract Syntax with Variable Binding - Gabbay, Pitts (2001) (33 citations) (Correct)
.... and Stark [PiS93a, Sta95] to explore the properties, with respect to semantic equivalence of programs, of call by value higher order functions and dynamically created names (see also [JeR99] In [Sta96a] Stark studies a model of the calculus based on one of Moggi s dynamic allocation monads [Mog89] in the presheaf category Set , where I is the category of nite ordinals and injective functions between them. Crucial ingredients of the dynamic allocation monad used there are the object of names , given by the inclusion functor I , Set, and the shift functor : Set Set , given by ....
Moggi, E.: An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Department of Computer Science, University of Edinburgh, 1989.
Constructing Tournament Representations: An exercise in pointwise.. - Hinze (2002) (4 citations) (Correct)
....relational setting. The problem of constructing tournament representations, which we consider in this paper, falls into this category. At rst sight, the generalization from functions to relations does away with the aforementioned bene ts of pure functional languages, but not quite. Using monads [16, 17] (in particular, the set monad) and monad comprehensions [27] in particular, set comprehensions) one can easily embed relations into a pure functional language. As a simple example, consider the converse of list catenation ( and : are Haskell s list constructors) split : 8a : a ] ....
Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Department of Computer Science, Edinburgh University, 1990.
A Formal Semantics for the C Programming Language - Nikolaos Papaspyrou Doctoral (1998) (1 citation) (Correct)
....A brief introduction to monads, their applications with respect to denotational semantics, the exact notation used in this thesis and pointers to useful bibliography on this field are given in Chapter 3. Comprehensive introductions to monads and their use in denotational semantics can be found in [Mogg90] and [Wadl92] 1.3 Overview of this thesis The main objective of this thesis is to develop and evaluate a formal description for the semantics of OBJECTIVES the C programming language. The developed semantics should satisfy the following requirements: ffl Accuracy: the formal description ....
....C [Wall93, Wall95] Modula 2 [Gure88, Morr88] Oberon [Kutt97b, Kutt97a] Occam [Gure90, Borg94a, Borg96] Prolog [Borg94b] and Smalltalk [Blak92] 1.5. Structure of this thesis 15 Monads have been proposed by Moggi as a ground breaking attempt to structure denotational MONADS semantics. [Mogg90] In a short time, the idea of monads was popularized by in the functional programming community by the work of Wadler [Wadl92] Since then, related research has focused on the combination of monads to structure semantic interpreters. Monad transformers, which were also first proposed by Moggi, ....
[Article contains additional citation context not shown here]
E. Moggi, "An Abstract View of Programming Languages", Technical Report ECSLFCS -90-113, University of Edinburgh, Laboratory for Foundations of Computer Science, 1990.
Pipes and Filters: Modelling a Software Architecture Through.. - Doberkat (2002) (Correct)
....on the category of sets, and the stochastic case through the functor which assigns each measurable set the space of all subprobability measures. Thus monads (and their associated Kleisli categories) form the common abstraction for both cases, bringing us into the realm of Moggi s argumentation [25, 24] that monads form a suitable basis for modelling computations. Consequently, our architectural modelling will be done on the basis of a monad. Categories vs. Architectures Categories with their emphasis on structure are a suitable formal tool for modelling software architectures. Focussing on ....
E. Moggi. An abstract view of programming languages. Lecture Notes, Stanford University, June 1989.
A Resumption Monad Transformer and its Applications in the.. - Papaspyrou (2001) (1 citation) (Correct)
....of category theory. In Computer Science, monads became very popular in the 1990s. The categorical properties of monads are discussed in most books on category theory, e.g. in [Barr96] For a comprehensive introductions to monads and their use in denotational semantics the user is referred to [Mogg90]. A somehow different approach to the definition of monads is found in [Wadl92] which expresses the current practice of monads in functional programming. The two approaches are equivalent. In this paper, the categorical approach (presented here) is used for the definition of monads, since it is ....
E. Moggi, "An Abstract View of Programming Languages", Technical Report ECS-LFCS-90113, University of Edinburgh, Laboratory for Foundations of Computer Science, 1990.
Value Recursion in Monadic Computations - Erkok (2002) (2 citations) (Correct)
....77] It was Moggi s influential work on monads that revolutionized the semantic treatment of e#ects, which he referred to as notions of computation. Moggi showed how monads can be used to model programming language features in a uniform way, providing an abstract view of programming languages [62, 63]. In the monadic framework, values of a given type are distinguished from computations that yield values of that type. Since the monadic structure hides the details of how computations are internally represented and composed, programmers and language designers work in a much more flexible ....
Moggi, E. An abstract view of programming languages. Tech. Rep. ECS-LFCS-90113, Dept. of Computer Science, Edinburgh Univ., 1990. (1)
Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2002) (Correct)
.... 2 ) 9b1 2 f1 (a1 ; 1 ) b1 ; b2 ) 2 S In case RL is the equality relation, the relation S relates f 1 and f 2 i S is a strong bisimulation between the labelled transition systems f 1 and f 2 . 6. 2 Logical relations for dynamic name creation Consider Moggi s model of dynamic name creation [15]. Let I be the category of nite sets and injective functions, and Set Set Set be the category of functors from I to Set Set Set and natural transformations (the category of covariant presheaves over I) For short, write T T TAs for T T T (A) s) and similarly for other notations. Let denote ....
E. Moggi. An abstract view of programming languages. Technical Report ECSLFCS -90-113, LFCS, Department of Computer Science, University of Edinburgh, 1990.
Fine-grained Information Flow Analysis for a lambda-calculus with .. - Simonet (2002) (Correct)
.... analysis concern realistic programming languages providing an exception mechanism such as Java [5] or ML [13] The treatment of exceptions in these systems seems relatively ad hoc and is not perfectly well understood: although there exists a simple monadic encoding of exceptions into sums [4, 19], these systems address exceptions in a direct manner. Indeed, both [5] and [13] try to achieve a better precision in the analysis of information flow due to exceptions than existing systems [3] dealing with sums provide. Because we describe a very accurate type system for sums, we are able to ....
....every expression e of E into an expression JeK of such that if e evaluates to a value v without raising an exception then JeK evaluates to LvM in and if the execution of e raises an exception v then JeK reduces to LvM. Such an encoding may be defined in a systematic way using monads [4, 19], but here we prefer, for simplicity, a direct translation. It is stable w.r.t. substitution in the sense that Je[x v]K = JeK[x ( LvM] The following lemmas establish the correctness of the encoding with respect to the semantics. Lemma 7.1 (Correctness) If e e then JeK Case ( ....
E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, University of Edinburgh, June 1989. URL: http://www.disi.unige.it/ person/MoggiE/ftp/abs-view.ps.gz.
Computational Effects and Operations: An Overview - Plotkin, Power (2002) (Correct)
No context found.
E. Moggi, An abstract view of programming languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
Combining Effects: Sum and Tensor - Hyland, Plotkin, Power (Correct)
No context found.
E. Moggi, An Abstract View of Programming Languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
Adequacy for Algebraic Effects - Plotkin, Power (2001) (Correct)
No context found.
E. Moggi, An Abstract View of Programming Languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
Algebraic Operations and Generic Effects - Plotkin, Power (Correct)
No context found.
E. Moggi, An Abstract View of Programming Languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
Semantics for Algebraic Operations - Plotkin, Power (2001) (Correct)
No context found.
Moggi, E., An abstract view of programming languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
Modularity in Meta-Languages - Mosses (Correct)
No context found.
E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Computer Science Dept., University of Edinburgh, 1990.
Notions of Computation Determine Monads - Plotkin, Power (2002) (6 citations) (Correct)
No context found.
E. Moggi, An Abstract View of Programming Languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
Combining Computational Effects: Commutativity and Sum - Hyland, Plotkin, Power (2002) (1 citation) (Correct)
No context found.
E. Moggi, An abstract view of programming languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
On the Observable Properties of - Higher Order Functions (Correct)
No context found.
E. Moggi. An Abstract View of Programming Languages. Lecture Notes, July 1989, 46pp.
On a Monadic Semantics for Freshness - Mark Shinwell Andrew (Correct)
No context found.
E. Moggi, An abstract view of programming languages, Tech. Rep. ECS-LFCS90 -113, Dept. Computer Science, Univ. Edinburgh (1989).
Coproducts Of Ideal Monads - Ghani, Uustalu (Correct)
No context found.
E. Moggi, An abstract view of programming languages, Techn. report ECS-LFCS-90-113, Lab. for Foundations of Comp. Sci., Univ. of Edinburgh (1990).
Coalgebras and Monads in the Semantics of Java - Jacobs, Poll (2002) (Correct)
No context found.
E. Moggi. An abstract view of programming languages. Techn. rep. LFCS-90113, Univ. Edinburgh, 1990.
Reusable Monadic Semantics of Object Oriented Programming.. - Gayo, Lovelle, Diez, Rio (Correct)
No context found.
Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Edinburgh University, Dept. of Computer Science, June 1989. Lecture Notes for course CS 359, Stanford University.
A Language Prototyping Tool Based on Semantic Building.. - Gayo, Lovelle, Diez.. (2001) (Correct)
No context found.
Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Edinburgh University, Dept. of Computer Science, June 1989. Lecture Notes for course CS 359, Stanford University.
International Journal of Foundations of Computer Science - World Scienti Publishing (Correct)
No context found.
Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Department of Computer Science, Edinburgh University, 1990.
Composing Monads Using Coproducts - Lüth, Ghani (Correct)
No context found.
E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, LFCS, 1990.
Logical Relations for Dynamic Name Creation - Zhang, Nowak (2003) (Correct)
No context found.
Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, LFCS, Department of Computer Science, University of Edinburgh, 1990.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC