Mark R. Shinwell, Andrew M. Pitts, Murdoch J. Gabbay  Home/Search
Context Related
| cl.cam.ac.uk/~amp12/papers...frepbm.pdf 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: cl.cam.ac.uk/~amp12/paper...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML datatypes involving binders are concrete, in the sense that values of these types can be deconstructed by matching against patterns naming bound variables explicitly. This may have the computational effect of swapping bound names with freshly generated ones; previous work on FreshML used a complicated static type system... (Update)
Cited by: More
Type-Safe Distributed Programming for OCaml - John Billings Peter (Correct)
A Sequent Calculus for Nominal Logic - Gabbay, Cheney (2004) (Correct)
A Denotational Account of Untyped Normalization by Evaluation - Filinski, Rohde (2003) (Correct)
Similar documents (at the sentence level):
23.3%: FreshML: Programming with Binders Made Simple - Shinwell, Pitts, Gabbay (2003) (Correct)
Active bibliography (related documents): More All
0.6: On the Denotational Semantics of Staged Execution of Open Code - Pitts, Sheard (2004) (Correct)
0.6: Nominal Logic Programming - Cheney (2004) (Correct)
0.5: Staged Computation with Names and Necessity - Nanevski, Pfenning (2005) (Correct)
Similar documents based on text: More All
0.8: FreshML user manual for version 1.0.0-b1 - Shinwell, Pitts (2002) (Correct)
0.5: A Metalanguage for Programming with Bound Names Modulo Renaming - Pitts, Gabbay (2000) (Correct)
0.4: On a Monadic Semantics for Freshness - Mark Shinwell Andrew (Correct)
Related documents from co-citation: More All
7: A new approach to abstract syntax with variable binding - Gabbay, Pitts - 2001
6: A first-order theory of names and binding - Pitts - 2001
5: Nominal unification - Urban, Pitts et al. - 2003
BibTeX entry: (Update)
M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programming with binders made simple. In Proc. ICFP 2003. http://citeseer.ist.psu.edu/shinwell03freshml.html More
@misc{ shinwell03freshml,
author = "M. Shinwell and A. Pitts and M. Gabbay",
title = "FreshML: Programming with binders made simple",
text = "M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programming with
binders made simple. In Proc. ICFP 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/shinwell03freshml.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
854 Information and Computation (context) - Milner, Parrow et al. - 1992
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
369 Information and Computation (context) - Moggi, computation - 1991
211 Domain theory - Abramsky, Jung - 1994
172 Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
118 A spatial logic for concurrency - Caires, Cardelli - 2002
106 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
106 Observable properties of higher order functions that dynamic.. - Pitts, Stark - 1993
69 Relational properties of domains - Pitts - 1996
45 A new approach to abstract syntax with variable binding - Gabbay, Pitts - 2002
38 A metalanguage for programming with bound names modulo renam.. - Pitts, Gabbay
32 a first order theory of names and binding - Pitts - 2001
31 Lisp and Symbolic Computation (context) - Stark, for - 1996
24 Manipulating trees with hidden labels (context) - Cardelli, Gardner et al. - 2003
24 Accomplishments and research challenges in metaprogramming - Sheard - 2001
24 A functional theory of local names - Odersky - 1994
22 An extension to ML to handle bound variables in data structu.. (context) - Miller - 1990
22 Meta-programming with names and necessity - Nanevski - 2002
20 A fully abstract domain model for the #- calculus (context) - Stark - 1996
17 A fully abstract model for the #-calculus (context) - Fiore, Moggi et al. - 1996
15 Observable sharing for functional circuit description - Claessen, Sands - 1999
14 Nominal unification - Urban, Pitts et al. - 2003
7 An axiomatic approach to metareasoning on nominal algebras i.. - Honsell, Miculan et al. - 2001
5 calculus in FM (context) - Gabbay - 2002
4 From interpreter to compiler and virtual machine: A function.. (context) - Ager, Biernacki et al. - 2003
4 Type-checking injective pure type systems - Barthe - 1999
4 Swapping the atom: Programming with binders in Fresh O'Caml (context) - Shinwell - 2003
3 A Theory of Inductive Definitions with #- Equivalence: Seman.. (context) - Gabbay - 2000
3 FreshML User Manual (context) - Shinwell, Pitts - 2002
2 Scrap your boilerplate: A practical approach to generic prog.. (context) - Laemmel, Jones - 2003
1 FM for process calculi that generate fresh names (context) - Gabbay - 2003
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/~amp12/papers/index.html): More
Operational Properties of Lily, a Polymorphic Linear.. - Bierman, Pitts, Russo (Correct)
Abstract Syntax with Variable Binding - Gabbay, al. (1999) (Correct)
On the Observable Properties of Higher Order Functions that.. - Pitts, Stark (1993) (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