The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type.

Published in: FSCD (2017)

Keyphrases

context free
lambda calculus
context sensitive
grammatical inference
database query languages
context dependent
type checking
finite state
context free grammars
programming language
inductive inference
predicate calculus
complex objects
parse tree
database systems