Intensional computation with higher-order functions
type: Item
instance of: scholarly article
title: Intensional computation with higher-order functions
zbMATH Open document ID: 1417.68041
published in: Theoretical Computer Science
publication date: 2019-03-26T00:00:00Z
Mathematics Subject Classification ID: 68Q01
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 7041829
zbMATH Keywords: intensional computation
zbMATH Keywords: higher-order functions
zbMATH Keywords: SF-calculus
zbMATH Keywords: foundations of computation
author: Barry Jay
describes a project that uses: MiniML
describes a project that uses: Coq
describes a project that uses: ML
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.02.016
OpenAlex ID: W2915506276
cites work: Term Rewriting and All That
cites work: Introduction to generalized type systems
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Typed self-evaluation via intensional type functions
cites work: An Unsolvable Problem of Elementary Number Theory
cites work: Q5565113
cites work: A modal analysis of staged computation
cites work: Q3994895
cites work: Q4722037
cites work: Pattern Calculus
cites work: A combinatory account of internal structure
cites work: Programming Languages and Systems
cites work: First-class patterns
cites work: Typed self-interpretation by pattern matching
cites work: Conflicting accounts of \(\lambda\)-definability
cites work: Q5287559
cites work: The Theory of Calculi with Explicit Substitutions Revisited
cites work: The next 700 programming languages
cites work: A theory of type polymorphism in programming
cites work: Linear-time self-interpretation of the pure lambda calculus
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
cites work: Q4201911
cites work: Q4799892
Wikidata QID: Q128319672
DOI: 10.1016/J.TCS.2019.02.016
description: scientific article; zbMATH DE number 7041829