Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
The Fortran subroutine BVLS (bounded variable least-squares) solves linear least-squares problems with upper and lower bounds on… Expand
Highly Cited
2002
Highly Cited
2002
Abstract. The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports… Expand
Highly Cited
1998
Highly Cited
1998
Preface. 1. Truth-conditional Semantics and the Fregean Program. 2. Executing the Fregean Program. 3. Semantics and Syntax. 4… Expand
Highly Cited
1997
Highly Cited
1997
β‐catenin is a central component of the cadherin cell adhesion complex and plays an essential role in the Wingless/Wnt signaling… Expand
Highly Cited
1995
Highly Cited
1995
MICROPOROUS inorganic materials such as zeolites find widespread application in heterogeneous catalysis, adsorption and ion… Expand
Highly Cited
1991
Highly Cited
1991
by containing implementations of higher-order unification. In this paper, we present a logic programming language, called L… Expand
  • figure 1
  • figure 2
Highly Cited
1989
Highly Cited
1989
Voltammetric methods were used to probe the interaction (electrostatic or intercalative) of metal complexes, ML 3 3+/2+ , with… Expand
  • table I
  • table 11
  • figure 1
  • figure 3
  • figure 2
Highly Cited
1985
Highly Cited
1985
From the Publisher: With an analytical and rigorous approach to problem solving and programming techniques,this book is oriented… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Highly Cited
1979
Highly Cited
1979
  • D. Turner
  • Softw. Pract. Exp.
  • 1979
  • Corpus ID: 40541269
It is shown how by using results from combinatory logic an applicative language, such as LISP, can be translated into a form from… Expand
Highly Cited
1953
Highly Cited
1953
entities from the very beginning rather than only where there is a real purpose in such reference. Hence my wish to keep general… Expand