Primitive Recursion for Higher-Order Abstract Syntax

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-62688-3_34
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Syntax and Semantics in Higher-Type Recursion Theory

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Syntax and Semantics in Higher-Type Recursion Theory

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Boxes Go Bananas: Encoding Higher-Order Abstract Syntax With Parametric Polymorphism

Journal of Functional Programming
Software
2007English

A Fully Abstract Denotational Model for Higher-Order Processes

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1994English

On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Characterizations of Time-Bounded Computations by Limited Primitive Recursion

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1974English

Nested Abstract Syntax in Coq

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2010English

Abstract Syntax Notation X (ASN.X)

2007English

Semantics Boosts Syntax in Artificial Grammar Learning Tasks With Recursion.

Journal of Experimental Psychology: Learning Memory and Cognition
LinguisticsLanguageExperimentalCognitive Psychology
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy