FAQ

Free variables and bound variables

Known as: Free variables, Variable binding operator, Apparent variable 
In mathematics, and in other disciplines involving formal languages, including mathematical logic and computer science, a free variable is a notation… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1958-2017
05019582017

Related topics

Related topics

40 relations
Abstract syntax treeAssociation listCombinatory logicComputable function
(More)

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Free variables and bound variables
Parameter
Computer science
Quantifier
Substitution
Convolution

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Bound Variables and C‐Command
It has long been assumed in linguistics that bound variable interpretations of pronouns are possible (only) when a quantified… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A New Approach to Abstract Syntax with Variable Binding
The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A Logic Programming Language with Lambda - Abstraction , Function Variables , and Simple Uni cationDale
It has been argued elsewhere that a logic programming language with function variables and-abstractions within terms makes a good… (More)
Is this relevant?
1990
1990
An Extension to ML to Handle Bound Variables in Data Structures: Preliminary Report
Most conventional programming languages have direct methods for representing first-order terms (say, via concrete datatypes in ML… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
It has been argued elsewhere that a logic programming language with function variables and λ-abstractions within terms makes a… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
1989
1989
De nability with Bounded Number of Bound Variables
A theory satis es the k variable property if every rst order formula is equivalent to a formula with at most k bound variables… (More)
Is this relevant?
1989
1989
Deenability with Bounded Number of Bound Variables
A theory satisses the k-variable property if every rst-order formula is equivalent to a formula with at most k bound variables… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Definability with Bounded Number of Bound Variables
A theory satis es the k variable property if every rst order formula is equivalent to a formula with at most k bound variables… (More)
Is this relevant?
1978
1978
Bound Variables and other Anaphors
When a noun phrase or a pronoun occurs in a sentence, it is frequently appropriate to ask what entity it refers to, but it is… (More)
  • table I
Is this relevant?