Question

Mitchell Foundations for PL 2.3.4 (observational equivalence)

score 59 · Answer 1 · 2024-01-30 05:34:25

59

Views

Mitchell Foundations for PL 2.3.4 (observational equivalence)

Published on 30 Jan 2024 - 5:34

score 601 · Answer 2 · 2014-02-27 08:50:15

601

Views

Consequences of difference between "strong" and weak Church-Rosser property

Published on 27 Feb 2014 - 8:50

score 321 · Answer 3 · 2012-04-25 22:25:38

321

Views

Bergman's Diamond Lemma: do these rules lead to a normal form?

Published on 25 Apr 2012 - 22:25

score 603 · Answer 4 · 2020-08-02 23:10:55

603

Views

What are the relations and differences between formal systems, rewriting systems, formal grammars and automata?

Published on 02 Aug 2020 - 23:10

score 69 · Answer 5 · 2020-08-10 12:54:55

69

Views

Why does $y \downarrow x$ imply $ x \leftrightarrow^* y$?

Published on 10 Aug 2020 - 12:54

score 60 · Answer 6 · 2020-08-10 13:32:49

60

Views

Does $x \leftrightarrow^* y$ already imply $x \rightarrow^* y$?

Published on 10 Aug 2020 - 13:32

score 1.3k · Answer 7 · 2020-08-11 12:01:23

1.3k

Views

What do "soundness" and "completeness" mean?

Published on 11 Aug 2020 - 12:01

score 49 · Answer 8 · 2020-08-14 13:45:20

49

Views

Does $T(\Sigma,V)$, the set of terms for signature $\Sigma$ and a set $V$ of variables, belong to syntax or semantics?

Published on 14 Aug 2020 - 13:45

score 83 · Answer 9 · 2020-09-16 10:06:49

83

Views

Is it possible to add computational facilities to otherwise "mathematical" formal systems by adjoining identities to types?

Published on 16 Sep 2020 - 10:06

score 104 · Answer 10 · 2020-10-04 13:09:45

104

Views

Non-identifiability of a periodic function

Published on 04 Oct 2020 - 13:09

score 71 · Answer 11 · 2021-04-23 14:49:54

71

Views

Question about number of occurences of a function symbol in a Term Rewriting System

Published on 23 Apr 2021 - 14:49

score 55 · Answer 12 · 2021-08-11 04:13:51

55

Views

Fewest applications of associativity

Published on 11 Aug 2021 - 4:13

score 95 · Answer 13 · 2021-10-11 18:42:49

95

Views

Rewriting quadratic expression

Published on 11 Oct 2021 - 18:42

score 52 · Answer 14 · 2021-11-02 21:15:21

52

Views

How does confluence apply (or not) in non-terminating rewriting systems?

Published on 02 Nov 2021 - 21:15

score 113 · Answer 15 · 2021-12-12 23:34:57

113

Views

Missing parentheses in $s(k (s I I))(s(\lambda y. s(k y))(\lambda y. s I I)$ leads to interesting error in an nLab page. Need a double check.

Published on 12 Dec 2021 - 23:34

List Question

Mitchell Foundations for PL 2.3.4 (observational equivalence)

Consequences of difference between "strong" and weak Church-Rosser property

Bergman's Diamond Lemma: do these rules lead to a normal form?

What are the relations and differences between formal systems, rewriting systems, formal grammars and automata?

Why does $y \downarrow x$ imply $ x \leftrightarrow^* y$?

Does $x \leftrightarrow^* y$ already imply $x \rightarrow^* y$?

What do "soundness" and "completeness" mean?

Does $T(\Sigma,V)$, the set of terms for signature $\Sigma$ and a set $V$ of variables, belong to syntax or semantics?

Is it possible to add computational facilities to otherwise "mathematical" formal systems by adjoining identities to types?

Non-identifiability of a periodic function

Question about number of occurences of a function symbol in a Term Rewriting System

Fewest applications of associativity

Rewriting quadratic expression

How does confluence apply (or not) in non-terminating rewriting systems?

Missing parentheses in $s(k (s I I))(s(\lambda y. s(k y))(\lambda y. s I I)$ leads to interesting error in an nLab page. Need a double check.

Trending Questions

Popular # Hahtags

Popular Questions