Matthias Felleisen  Home/Search
Context Related
| indiana.edu/pub/scheme...express.ps.gz rice.edu/CS/PLT/Pu...91felleisen.ps.gz indiana.edu/indra/schem...express.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/sch...oc.publications (more) From: indiana.edu Homepages: M.Felleisen |
Rate this article:      (best)Comment on this article |
Abstract: The literature on programming languages contains an abundance of informal claims on the relative expressive power of programming languages, but there is no framework for formalizing such statements nor for deriving interesting consequences. As a first step in this direction, we develop a formal notion of expressiveness and investigate its properties. To validate the theory, we analyze some widely held beliefs about the expressive power of several extensions of functional languages. Based on... (Update)
Context of citations to this paper: More
...a closed lambda abstraction ( x 1 ; xn : e) or a reference ref (i) The metavariable v ranges over values. An evaluation context [Fel90] E is an expression with an occurrence of a hole [ and is of one of the forms 1. 2. e 1 ; e n ) 3. v(v 1 ; v j 1...
Cited by: More
Return Types for Functional Continuations - Carl Gunter University (Correct)
Active Libraries and Universal Languages - Veldhuizen (2004) (Correct)
Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
Active bibliography (related documents): More All
0.4: Embedding as a tool for Language Comparison: On the CSP hierarchy - de Boer, al. (1991) (Correct)
0.4: Embedding as a tool for Language Comparison - de Boer, Palamidessi (1994) (Correct)
0.2: Recursion is a Computational Effect - Friedman, Sabry (2000) (Correct)
Similar documents based on text: More All
0.0: Aircraft Design Problem Implementation Under The.. - Sistla, Dovi, Su.. (1999) (Correct)
0.0: CPS Transformation of Flow Information - Palsberg (1998) (Correct)
0.0: S-Expressiveness and the Abstractive Power of Programming Languages - Shutt (1999) (Correct)
Related documents from co-citation: More All
14: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
11: The revised report on the syntactic theories of sequential control and state - Felleisen, Hieb - 1992
10: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
BibTeX entry: (Update)
Matthias Felleisen. On the Expressive Power of Programming Languages. In Proc. European Symposium on Programming, in LNCS 432, pages 134--151. Springer-Verlag, 1990. http://citeseer.ist.psu.edu/felleisen90expressive.html More
@incollection{ felleisen90expressive,
author = "Matthias Felleisen",
title = "On the Expressive Power of Programming Languages",
booktitle = "{ESOP} '90 3rd European Symposium on Programming, Copenhagen, Denmark",
volume = "432",
publisher = "Springer-Verlag",
address = "New York, N.Y.",
editor = "N. Jones",
pages = "134-151",
year = "1990",
url = "citeseer.ist.psu.edu/felleisen90expressive.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
809 A theory of type polymorphism in programming (context) - Milner - 1978
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
419 A formulation of the simple theory of types (context) - Church - 1940
343 Introduction to Metamathematics (context) - Kleene - 1952
306 LCF considered as a programming language (context) - Plotkin - 1977
234 Multilisp: A language for concurrent symbolic computataion (context) - Halstead - 1985
197 The revised 3 report on the algorithmic language Scheme - Rees, Clinger - 1986
173 An initial algebra approach to the specification (context) - Goguen, Thatcher et al. - 1979
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1989
131 The essence of Algol (context) - Reynolds - 1981
118 Lambda-Calculus Models of Programming Languages (context) - Morris - 1968
107 Complete type inference for simple objects (context) - Wand - 1987
104 Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
84 The next 700 programming languages (context) - Landin - 1966
83 A Course in Universal Algebra - Burris, Sankappanaras - 1981
81 The theory and practice of first-class prompts (context) - Felleisen - 1988
76 Control operators (context) - Felleisen, Friedman - 1986
69 Revised report on the algorithmic language ALGOL (context) - Naur - 1963
49 Cons should not evaluate its arguments (context) - Friedman, Wise - 1976
46 CS-Conversion: A Syntactic Theory of Control and State in Im.. (context) - Felleisen - 1987
40 Single-threaded polymorphic lambda-calculus (context) - Guzm'an, Hudak - 1990
36 Reasoning with continuations II: Full abstraction for models.. - Sitaram, Felleisen - 1990
31 The incremental garbage collection of processes - Baker, Hewitt - 1977
27 Scheme: An interpreter for extended lambda calculus (context) - Sussman, Jr - 1975
24 GEDANKEN---A simple typeless language based on the principle.. (context) - Reynolds - 1970
22 The expressiveness of simple and second-order type structure.. (context) - Fortune, Leivant et al. - 1980
21 Comparative schematology (context) - Paterson, Hewitt - 1970
20 The lazy -calculus (context) - Abramsky - 1988
20 Lambda: The ultimate imperative (context) - Steele, Jr - 1976
18 call-by-value (context) - Plotkin - 1975
17 Syntactic Extensions in the Programming Language Lisp (context) - Kohlbecker - 1986
13 Continuations may be unreasonable (context) - Meyer, Riecke - 1988
12 Fully abstract models of the lazy lambda-calculus (context) - Ong - 1988
7 Notational definition---A formal account (context) - Griffin - 1988
6 Semantical Paradigms (context) - Meyer - 1988
6 A types-as-sets semantics for Milner-style polymorphism (context) - Wand - 1984
5 The varieties of programming languages (context) - Hoare - 1989
4 calculus approach (context) - Landin - 1966
4 A complete and decidable proof system for call-by-value equa.. (context) - Riecke - 1990
4 S'equentialit'e de l'evaluation formelle des -expressions (context) - Berry - 1978
3 The power of programming features (context) - Chandra, Manna - 1975
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/scheme-repository/doc.publications.html): More
A Parallel Virtual Machine for Efficient Scheme Compilation - Feeley, Miller (1990) (Correct)
Register Allocation Using Lazy Saves, Eager Restores, and .. - Burger, Waddell, Dybvig (1995) (Correct)
A Scheme Shell - Shivers (1994) (Correct)
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