Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

Что (кто) такое redex - определение

REPLACING SUBTERM IN A FORMULA WITH ANOTHER TERM

Term rewriting; Term rewriting system; Term-rewriting; Rewrite system; Rewrite rule; Phase-structure rule; Rewriting system; Term Rewriting System; Reducible expression; Redex; Rewrite rules; Transformational rule; Rewriting logic; Term rewrite system; Reduction system; Substitution system; Reduction systems; Termination (term rewriting); Termination (rewriting); Trace rewriting system; Tree rewriting; Rewriter

$'''Pic.2:''' Rule lhs term <math>x*(y*z)</math> matching in term <math>\frac{a*((a+1)*(a+2))}{1*(2*3)}</math>$
$'''Pic.1:''' Schematic triangle diagram of application of a rewrite rule <math>l \longrightarrow r</math> at position <math>p</math> in a term, with matching substitution <math>\sigma</math>$

Найдено результатов: 9

redex

Reducible Expression. An expression matching the left hand side of a reduction rule or definition.

1955 RedeX Trophy

MOTOR CAR RACE

The 3rd RedeX Trophy was a motor race, run to Formula One rules, held on 13 August 1955 at Snetterton Circuit, Norfolk. The race was run over 25 laps, and was won by American driver Harry Schell in a Vanwall.

https://en.wikipedia.org/wiki/1955_RedeX_Trophy

1951 Redex 100

AUSTRALIAN MOTOR RACE

The 1951 Redex 100 was a motor race staged at the Mount Panorama Circuit, Bathurst, New South Wales, AustraliaJohn Medley, Bathurst: Cradle of Australian Motor Sport, 1997, page 119 on 26 March 1951.Souvenir Programme, Car Racing - Bathurst, Easter Monday, March 26th 1951

https://en.wikipedia.org/wiki/1951_Redex_100

1954 RedeX Trophy

MOTOR CAR RACE

The 2nd RedeX Trophy was a motor race, run to Formula One rules, held on 14 August 1954 at Snetterton Circuit, Norfolk. The race was run over 40 laps, and was won by British driver Reg Parnell in a Ferrari 625, setting fastest lap in the process.

https://en.wikipedia.org/wiki/1954_RedeX_Trophy

term rewriting system

(TRS) A collection of rewrite rules used to transform terms (expressions, strings in some formal language) into equivalent terms. See reduction. (1994-11-04)

Rewriting

In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines,

https://en.wikipedia.org/wiki/Rewriting

Round Australia Trial

1995 Mobil 1 Trial; 1995 Mobil 1 Round Australia Trial; 1979 Repco Reliability Trial; Redex Trial; Redex Trials

The Round Australia Trial was a long distance rally (a form of motorsport that takes place on public or private roads), which was run on multiple occasions between 1953 and 1998, circumnavigating Australia. Its early years were tremendously popular as the roads through large portions of the country, particularly west of Adelaide, were not in good condition.

https://en.wikipedia.org/wiki/Round_Australia_Trial

Head Normal Form

POTENTIAL STATE FOR A TERM IN LAMBDA CALCULUS

Beta-eta normal form; Head normal form; Beta redex

<theory, reduction> (HNF) A term describing a {lambda expression} whose top level is either a variable, a data value, a built-in function applied to too few arguments, or a lambda abstraction whose body is not reducible. I.e. the top level is neither a redex nor a lambda abstraction with a reducible body. An expression in HNF may contain redexes in argument postions whereas a normal form may not. Compare Weak Head Normal Form. (2003-01-08)

Beta normal form

POTENTIAL STATE FOR A TERM IN LAMBDA CALCULUS

Beta-eta normal form; Head normal form; Beta redex

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.

https://en.wikipedia.org/wiki/Beta_normal_form

Википедия

Rewriting

In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines, or reduction systems). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects.

Rewriting can be non-deterministic. One rule to rewrite a term could be applied in many different ways to that term, or more than one rule could be applicable. Rewriting systems then do not provide an algorithm for changing one term to another, but a set of possible rule applications. When combined with an appropriate algorithm, however, rewrite systems can be viewed as computer programs, and several theorem provers and declarative programming languages are based on term rewriting.

https://en.wikipedia.org/wiki/Rewriting