Centril rfc-total-fn issues

Centril / rfc-total-fn

This repo exists for the sole purpose for preparing and writing up an RFC on 'total fn' in Rust.

1 stars 0 forks source link

issues

Newest

Newest Most commented Recently updated Oldest Least commented Least recently updated

Random quotes

#20 Centril opened 6 years ago
0
Papers

#19 Centril opened 6 years ago
1
const fn calls within total functions?

#18 ejmount opened 6 years ago
3
Safe replace_with without panicing

#17 Centril opened 6 years ago
0
Design of "UpperBoundedIterator"... Have it?

#16 Centril opened 6 years ago
0
Link to Dijkstra's paper for "prove the absence of bugs, and being able to prove the absence"

#15 Centril closed 6 years ago
0
Are a subset of while loops for which totality is decidable to be allowed in total fn?

#14 Centril opened 6 years ago
2
Can/how do you specify totalness on a function parameter?

#13 ejmount opened 6 years ago
1
Other things being `total` ala `const`

#12 ejmount opened 6 years ago
0
Future reference: never_type related

#11 Centril opened 6 years ago
0
Implicit or explicit total closures?

#10 ejmount opened 6 years ago
4
Can we crash for lack of stack space?

#9 ejmount opened 6 years ago
1
Unbounded recursion with function parameters?

#8 ejmount opened 6 years ago
0
Is heap allocation total? Is heap access? (non-null const *T deref) Is arbitarary const* T deref?

#7 ejmount opened 6 years ago
0
Can total functions recurse? (Directly or indirectly?)

#6 ejmount opened 6 years ago
0
Is FFI total?

#5 ejmount opened 6 years ago
0
total fn <: no_panic fn

#4 Centril opened 6 years ago
0
untotal {} blocks?

#3 Centril opened 6 years ago
0
Motivation: Using Rust for railway software / [no_core]

#2 Centril opened 6 years ago
0
Given impl<const N: usize> X for Y<f(N)> and impl<const N: usize> X for Y<g(N)>, overlap checking is decidable when f, g are total

#1 Centril opened 6 years ago
2