User Jake

24 votes

4 answers

5k views

How do garbage collectors avoid stack overflow?

asked Apr 20, 2015 at 20:52

12 votes

2 answers

309 views

Reducing products in HoTT to church/scott encodings

asked Oct 21, 2017 at 20:49

10 votes

1 answer

364 views

Are combinatory logic terms always larger?

asked Jul 6, 2015 at 22:21

9 votes

1 answer

1k views

Conflict Driven Clause Learning backtracking clarification

asked May 28, 2015 at 4:08

9 votes

2 answers

261 views

Domain Theory and Polymorphism

asked Nov 22, 2016 at 3:41

8 votes

2 answers

504 views

Solving systems of linear equations over semirings

asked Mar 18, 2016 at 2:56

7 votes

1 answer

202 views

How do we know $\neg \neg LEM$ isn't provable in MLTT?

asked Apr 20, 2019 at 22:14

6 votes

1 answer

131 views

Understanding simulated annealing information theoretically

asked Oct 28, 2019 at 21:35

6 votes

0 answers

698 views

Is the strictly positive condition in Coq and Agda an aproximation?

asked May 9, 2015 at 23:44

6 votes

0 answers

105 views

Bounded existential polymorphism

asked Jul 28, 2014 at 23:28

5 votes

2 answers

428 views

Using SMT solvers to generate random solutions to given predicate

asked Dec 4, 2014 at 7:08

5 votes

1 answer

104 views

How to understand equivalence of indexes of a family of types that are not definitionally equal

asked Apr 29, 2015 at 23:00

5 votes

2 answers

443 views

Algorithmic type checking for Calculus of Inductive Constructions

asked Apr 9, 2015 at 20:57

5 votes

2 answers

246 views

Implicit complexity and interpretation of total languages

asked Feb 22, 2016 at 20:31

5 votes

1 answer

152 views

Complexity of black box satisfiablty

asked Aug 10, 2015 at 23:11

4 votes

1 answer

124 views

Sequence of total languages whose limit is turing complete

asked Sep 15, 2015 at 17:23

4 votes

2 answers

114 views

"Compressing" rationals given error bounds

asked Aug 7, 2015 at 1:33

4 votes

0 answers

77 views

Understanding a paper on polynomial recursion in all finite types

asked Nov 23, 2014 at 22:45

4 votes

0 answers

71 views

Deadlock free process calculi

asked Jul 10, 2016 at 22:38

4 votes

1 answer

182 views

How does lack of deadlock relate to computability in process calculi?

asked Oct 3, 2016 at 3:13

4 votes

0 answers

2k views

$NP = PSPACE$ and what that would mean about $PH$

asked Oct 10, 2016 at 18:01

4 votes

2 answers

115 views

Efficiently generating a prime polynomial of a given degree

asked Mar 8, 2018 at 6:09

3 votes

0 answers

65 views

Data structure for finding greatest lower bound with respect to a partial order

asked Mar 24, 2022 at 18:29

3 votes

0 answers

160 views

Solving systems of boolean equations

asked Jul 23, 2016 at 22:04

3 votes

1 answer

363 views

Subset sum-like problem over boolean vectors

asked Jul 31, 2016 at 20:29

3 votes

0 answers

83 views

Computational complexity of logistic map

asked May 27, 2016 at 8:41

2 votes

1 answer

87 views

Enumerating every "partnering" without repeating partners

asked May 28, 2020 at 1:51

2 votes

1 answer

52 views

SMT solves with functions for free varibles

asked Dec 8, 2014 at 19:07

2 votes

0 answers

214 views

Are there models of type theory that allow the real numbers to be a type?

asked Jun 15, 2014 at 17:19

1 vote

0 answers

24 views

Importance of indexes in Type(i) in calculus of inductive constructions [duplicate]

asked Mar 25, 2015 at 20:30

Stack Exchange Network

40 Questions

How do garbage collectors avoid stack overflow?

Reducing products in HoTT to church/scott encodings

Are combinatory logic terms always larger?

Conflict Driven Clause Learning backtracking clarification

Domain Theory and Polymorphism

Solving systems of linear equations over semirings

How do we know $\neg \neg LEM$ isn't provable in MLTT?

Understanding simulated annealing information theoretically

Is the strictly positive condition in Coq and Agda an aproximation?

Bounded existential polymorphism

Using SMT solvers to generate random solutions to given predicate

How to understand equivalence of indexes of a family of types that are not definitionally equal

Algorithmic type checking for Calculus of Inductive Constructions

Implicit complexity and interpretation of total languages

Complexity of black box satisfiablty

Sequence of total languages whose limit is turing complete

"Compressing" rationals given error bounds

Understanding a paper on polynomial recursion in all finite types

Deadlock free process calculi

How does lack of deadlock relate to computability in process calculi?

$NP = PSPACE$ and what that would mean about $PH$

Efficiently generating a prime polynomial of a given degree

Data structure for finding greatest lower bound with respect to a partial order

Solving systems of boolean equations

Subset sum-like problem over boolean vectors

Computational complexity of logistic map

Enumerating every "partnering" without repeating partners

SMT solves with functions for free varibles

Are there models of type theory that allow the real numbers to be a type?

Importance of indexes in Type(i) in calculus of inductive constructions [duplicate]