Peter Møller Neergaard  Home/Search
Context
Related
| churchproject.org...daplas2004.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: churchproject.org/reports/ele... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas e#- ciently. The design choices however e#ect the e#ciency of the algorithms written in the languages. It is therefore important to understand how such choices e#ect the expressibility of programming languages. (Update)
Active bibliography (related documents): More All
2.1: A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
0.9: BC_ε: Recursion-Theoretic Characterization of LOGSPACE - Neergaard (2004) (Correct)
0.5: A Bargain for Intersection Types: A Simple Strong Normalization.. - Neergaard (Correct)
Similar documents based on text: More All
0.6: Conservation and Uniform Normalization in Lambda Calculi.. - Neergaard, Sørensen (2002) (Correct)
0.5: How Light Is Safe Recursion? Compositional Translations.. - Neergaard, Mairson (2001) (Correct)
0.3: Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004) (Correct)
BibTeX entry: (Update)
@misc{ neergaard-functional,
author = "Peter Møller Neergaard",
title = "A Functional Language for Logarithmic Space",
url = "citeseer.ist.psu.edu/725685.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997 ACM
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
362 ML for the Working Programmer (context) - Paulson - 1996 ACM
211 Languages that capture complexity classes - Immerman - 1987 ACM DBLP
96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992
58 Linear type and non-size-increasing polynomial time computat.. - Hofmann - 1999
26 Predicative Recursion and Computational Complexity - Bellantoni - 1992 ACM
21 Light linear logic - Girard - 1998 ACM DBLP
16 Relating typability and expressibility in finite-rank inters.. (context) - Kfoury, Mairson et al. - 1999
12 Characterizing complexity classes by higher type primitive r.. (context) - Goerdt - 1992 ACM DBLP
4 Pure versus impure lisp - Pippenger - 1996 ACM DBLP
3 New recursion-theoretic characterizations of well-knwon comp.. (context) - Kristiansen
3 Computatational Complexity (context) - Papadimitriou - 1994
3 An example SML implemenation of a logspace linear bc evaluat.. (context) - Neergaard - 2003
3 The expressive power of higher-order types (context) - Jones - 2001
2 and impotency: Why nonlinearity and amnesia make a type syst.. (context) - Neergaard, Mairson et al. - 2004
2 Complexity Aspects of Programming Language Design--- From Lo.. (context) - Neergaard - 2004
2 Can safe recursion be interpreted in light logic (context) - Murawski, Ong - 2000
1 Two simple intrinsic characterizations of main complexity cl.. - Voda
Documents on the same site (http://www.church-project.org/reports/electronic/): More
Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004) (Correct)
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (Correct)
Meta-Programming through Typeful Code Representation - Chen, Xi (2003) (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