Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое Weak Head Normal Form - определение
POTENTIAL STATE FOR A TERM IN LAMBDA CALCULUS
Beta-eta normal form; Head normal form; Beta redex
Найдено результатов: 4795
Weak Head Normal Form
SUMMARY OF FORMAL DEFINITIONS OF LAMBDA CALCULUS
Weak head normal form
<reduction, lambda calculus> (WHNF) A lambda expression is
in weak head normal form (WHNF) if it is a head normal form
(HNF) or any lambda abstraction. I.e. the top level is not
a redex.
The term was coined by Simon Peyton Jones to make explicit
the difference between head normal form (HNF) and what
graph reduction systems produce in practice. A lambda
abstraction with a reducible body, e.g.
x . (( y . y+x) 2)
is in WHNF but not HNF. To reduce this expression to HNF
would require reduction of the lambda body:
( y . y+x) 2 --> 2+x
Reduction to WHNF avoids the name capture problem with its
need for alpha conversion of an inner lambda abstraction and
so is preferred in practical graph reduction systems.
The same principle is often used in strict languages such as
Scheme to provide call-by-name evaluation by wrapping an
expression in a lambda abstraction with no arguments:
D = delay E = () . E
The value of the expression is obtained by applying it to the
empty argument list:
force D = apply D ()
= apply ( () . E) ()
= E
(1994-10-31)
Lambda calculus definition
SUMMARY OF FORMAL DEFINITIONS OF LAMBDA CALCULUS
Weak head normal form
Lambda calculus is a formal mathematical system based on lambda abstraction and function application. Two definitions of the language are given here: a standard definition, and a definition using mathematical formulas.
Third normal form
NORMALIZING A DATABASE DESIGN TO REDUCE THE DUPLICATION OF DATA AND ENSURE REFERENTIAL INTEGRITY
3NF; Third Normal Form; 3rd normal form
Third normal form (3NF) is a database schema design approach for relational databases which uses normalizing principles to reduce the duplication of data, avoid data anomalies, ensure referential integrity, and simplify data management. It was defined in 1971 by Edgar F.
3NF
NORMALIZING A DATABASE DESIGN TO REDUCE THE DUPLICATION OF DATA AND ENSURE REFERENTIAL INTEGRITY
3NF; Third Normal Form; 3rd normal form
third normal form
NORMALIZING A DATABASE DESIGN TO REDUCE THE DUPLICATION OF DATA AND ENSURE REFERENTIAL INTEGRITY
3NF; Third Normal Form; 3rd normal form
Disjunctive Normal Form
CONCEPT IN BOOLEAN LOGIC
Sum-of-product; Disjunct normal form; Disjunctive Normal Form; Full disjunctive normal form; Sum-of-products expression; Disjunctive normal formula
(DNF) A logical formula consisting of a disjunction of
conjunctions where no conjunction contains a disjunction.
E.g. the DNF of (A or B) and C is (A and C) or (B and C).
(1994-12-07)
second normal form
DATABASE NORMALIZATION REQUIREMENT AFTER FIRST NORMAL FORM
2NF; 2nd normal form
Second normal form
DATABASE NORMALIZATION REQUIREMENT AFTER FIRST NORMAL FORM
2NF; 2nd normal form
Second normal form (2NF) is a normal form used in database normalization. 2NF was originally defined by E.
Hesse normal form
REPRESENTATION OF A PLANE AS A NORMAL AND DISTANCE
Hessian normal form
The Hesse normal form named after Otto Hesse, is an equation used in analytic geometry, and describes a line in \mathbb{R}^2 or a plane in Euclidean space \mathbb{R}^3 or a hyperplane in higher dimensions..John Vince: Geometry for Computer Graphics.
2NF
DATABASE NORMALIZATION REQUIREMENT AFTER FIRST NORMAL FORM
2NF; 2nd normal form
Википедия
Beta normal form
In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta-eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in head normal form if there is no beta-redex in head position. The normal form of a term, if one exists, is unique (as a corollary of the Church–Rosser theorem). However, a term may have more than one head normal form.
