User Charles Stewart

108

votes

7

answers

8k

views

Solid applications of category theory in TCS?

May 8 '19 at 9:06 Community♦ 1

78

votes

5

answers

4k

views

Techniques for Reversing the Order of Quantiﬁers

lo.logic big-picture proof-techniques

Jan 24 '11 at 12:25 Community♦ 1

65

votes

3

answers

8k

views

How do I referee a paper?

soft-question big-list paper-review

Feb 23 '11 at 1:28 Community♦ 1

49

votes

3

answers

5k

views

Shallow versus Deep Embeddings

lo.logic coq proof-assistants

Mar 3 '13 at 21:08 Makarius 425

42

votes

8

answers

3k

views

Rigour leading to insight

big-list soft-question proofs

May 25 '11 at 19:56 Community♦ 1

41

votes

7

answers

5k

views

Truly random number generator: Turing computable?

reference-request computability turing-machines randomness

Sep 17 '10 at 17:05 Community♦ 1

34

votes

3

answers

2k

views

What is the Volume of Information?

it.information-theory physics

Jun 8 '17 at 7:31 Community♦ 1

28

votes

4

answers

6k

views

What is the most powerful kind of parser?

fl.formal-languages pl.programming-languages grammars

May 23 '16 at 21:35 user2373145 3

28

votes

1

answer

5k

views

What's the difference between the Actor Model of Concurrency and Communicating Sequential Processes

concurrency

Aug 1 '13 at 8:00 nish1013 145

25

votes

1

answer

1k

views

Are types propositions? (What are types exactly?)

lo.logic type-theory proof-theory

Apr 5 '11 at 21:51 Kaveh 21k

25

votes

2

answers

1k

views

What is the folk model of linear logic?

pl.programming-languages ct.category-theory imperative-programming denotational-semantics linear-logic

Feb 28 '12 at 21:13 Uday Reddy 4,566

24

votes

6

answers

2k

views

How should I think about proof nets?

lo.logic soft-question pl.programming-languages linear-logic

Nov 9 '13 at 18:44 Community♦ 1

19

votes

4

answers

2k

views

Computational complexity in quantitative finance

cc.complexity-theory reference-request survey ce.computational-finance algorithmic-lens

Dec 16 '16 at 7:17 Community♦ 1

19

votes

4

answers

2k

views

How are side effects handled in semantics?

imperative-programming semantics big-picture

May 16 '13 at 8:07 Charles Stewart 4,236

17

votes

5

answers

398

views

Open or Interactive Constraint Satisfaction

sat lo.logic csp

Sep 2 '11 at 14:35 Community♦ 1

15

votes

1

answer

369

views

Looking for papers and articles on the Tarskian Möglichkeit

Mar 27 '12 at 20:17 Paulo 446

15

votes

2

answers

3k

views

Is propositional resolution a complete proof system?

lo.logic terminology proof-complexity proof-theory resolution

Feb 23 '13 at 22:00 Community♦ 1

14

votes

1

answer

635

views

What are the historical roots of Milner's bigraphs?

process-algebra ho.history-overview

Aug 27 '10 at 21:51 András Salamon 18.4k

13

votes

1

answer

642

views

Circuits with oracles vs. Turing Machines with oracles

cc.complexity-theory turing-machines oracles circuit-families

Aug 6 '12 at 9:26 Community♦ 1

13

votes

3

answers

4k

views

How to write a negative review for a conference paper?

soft-question paper-review

Feb 23 '11 at 1:28 Community♦ 1

12

votes

1

answer

373

views

When do coherence spaces have pullbacks and pushouts?

pl.programming-languages ct.category-theory domain-theory linear-logic

Jan 21 '11 at 14:21 Neel Krishnaswami 30.2k

12

votes

3

answers

726

views

For what languages is there already a theory of observational equivalence?

pl.programming-languages type-theory operational-semantics

Mar 10 '17 at 21:09 Andrej Bauer 24.6k

12

votes

2

answers

3k

views

Data structure that allow efficient tag based lookups

ds.data-structures application-of-theory db.databases

May 6 '11 at 20:22 Community♦ 1

10

votes

5

answers

3k

views

Automata Theory / Formal Language Thesis Topic

ds.algorithms automata-theory fl.formal-languages soft-question

Oct 5 '10 at 1:27 Dai Le 3,614

10

votes

1

answer

513

views

What are the theoretical limits of the Stratego Programming Language?

functional-programming

Sep 16 '10 at 6:56 Dave Clarke 16.3k

9

votes

1

answer

455

views

In System F à la Church, can we automatize type inference for the for-all elimination?

type-theory polymorphism type-inference

Sep 16 '10 at 13:08 Marc 626

8

votes

5

answers

660

views

Algorithm for inverting a bijective function.

ds.algorithms

Aug 18 '10 at 3:51 Kendall Hopkins 207

6

votes

1

answer

388

views

Term that can distinguish beta-equivalent normal forms in the untyped lambda calculus

lo.logic computability pl.programming-languages lambda-calculus

Aug 14 '12 at 19:18 Petr 2,341

4

votes

1

answer

319

views

Exponential blowup in Simple Proof of a theorem of Statman by Mairson

lo.logic lower-bounds lambda-calculus

Aug 31 '12 at 18:00 Kaveh 21k

3

votes

0

answers

345

views

Are grammars programs? [closed]

fl.formal-languages terminology

May 7 '11 at 8:23 Vag 443

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

31 Bookmarks

Solid applications of category theory in TCS?

Techniques for Reversing the Order of Quantiﬁers

How do I referee a paper?

Shallow versus Deep Embeddings

Rigour leading to insight

Truly random number generator: Turing computable?

What is the Volume of Information?

What is the most powerful kind of parser?

What's the difference between the Actor Model of Concurrency and Communicating Sequential Processes

Are types propositions? (What are types exactly?)

What is the folk model of linear logic?

How should I think about proof nets?

Computational complexity in quantitative finance

How are side effects handled in semantics?

Open or Interactive Constraint Satisfaction

Looking for papers and articles on the Tarskian Möglichkeit

Is propositional resolution a complete proof system?

What are the historical roots of Milner's bigraphs?

Circuits with oracles vs. Turing Machines with oracles

How to write a negative review for a conference paper?

When do coherence spaces have pullbacks and pushouts?

For what languages is there already a theory of observational equivalence?

Data structure that allow efficient tag based lookups

Automata Theory / Formal Language Thesis Topic

What are the theoretical limits of the Stratego Programming Language?

In System F à la Church, can we automatize type inference for the for-all elimination?

Algorithm for inverting a bijective function.

Term that can distinguish beta-equivalent normal forms in the untyped lambda calculus

Exponential blowup in Simple Proof of a theorem of Statman by Mairson

Are grammars programs? [closed]