Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
42
views
17
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
521
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Programming Languages and Systems
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
other
Author(s):
Matthew R. Lakin
,
Andrew M. Pitts
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Most cited references
17
Record
: found
Abstract
: not found
Article
: not found
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
N.G de Bruijn
(1972)
0
comments
Cited
96
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Nominal logic, a first order theory of names and binding
Andrew M. Pitts
(2003)
0
comments
Cited
60
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The revised report on the syntactic theories of sequential control and state
Matthias Felleisen
,
Robert Hieb
(1992)
0
comments
Cited
38
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 47-61
DOI:
10.1007/978-3-642-00590-9_4
SO-VID:
8bca6fb1-00de-4ef0-b4da-d53b6655a12d
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Well-Typed Programs Can’t Be Blamed
pp. 17
Exploring the Design Space of Higher-Order Casts
pp. 32
Practical Variable-Arity Polymorphism
pp. 47
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
pp. 62
Using Category Theory to Design Programming Languages
pp. 64
Modular Monad Transformers
pp. 80
Handlers of Algebraic Effects
pp. 95
Is Structural Subtyping Useful? An Empirical Study
pp. 112
An Interval-Based Inference of Variant Parametric Types
pp. 128
Existential Quantification for Variant Ownership
pp. 143
Formalising and Verifying Reference Attribute Grammars in Coq
pp. 160
Verified, Executable Parsing
pp. 175
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
pp. 190
Amortised Memory Analysis Using the Depth of Data Structures
pp. 205
The Financial Crisis, a Lack of Contract Specification Tools: What Can Finance Learn from Programming Language Design?
pp. 207
All Secrets Great and Small
pp. 222
Type-Based Automated Verification of Authenticity in Cryptographic Protocols
pp. 237
A Theory of Non-monotone Memory (Or: Contexts for free)
pp. 252
Abstraction for Concurrent Objects
pp. 267
Minimization Algorithm for Symbolic Bisimilarity
pp. 285
Conversation Types
pp. 301
Abstract Processes in Orchestration Languages
pp. 316
Global Principal Typing in Partially Commutative Asynchronous Sessions
pp. 333
Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services
pp. 348
Automatic Parallelization with Separation Logic
pp. 363
Deny-Guarantee Reasoning
pp. 378
A Basis for Verifying Multi-threaded Programs
pp. 394
SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs
Similar content
521
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Authors:
Dahmun Goudarzi
,
Matthieu Rivain
Preparation of sustainable and green cement-based composite binders with high-volume steel slag powder and ultrafine blast furnace slag powder
Authors:
Yu. Liu
,
Zengqi Zhang
,
Guihua Hou
…
Pseudohyperkalemia and the Need for Imperative Caution With the Newly Introduced Potent Potassium Binders: Two Cases
Authors:
Macaulay Onuigbo
,
Adam M. Ross
See all similar
Cited by
3
Constraint solving in non-permutative nominal abstract syntax
Authors:
Matthew R. Lakin
\(\alpha\)Check: A mechanized metatheory model-checker
Authors:
James Cheney
,
Alberto Momigliano
Nominal Unification Revisited
Authors:
Christian Urban
See all cited by