Inferir tipos de refinamiento
En el trabajo, se me ha encomendado la tarea de inferir cierta información sobre un lenguaje dinámico. Reescribo secuencias de declaraciones en letexpresiones anidadas , así: return x; Z => x var x; Z => let x = undefined in Z x = y; Z => let x = y in Z if x then T else F; Z => if x...
programming-languages
logic
type-theory
type-inference
machine-learning
data-mining
clustering
order-theory
reference-request
information-theory
entropy
algorithms
algorithm-analysis
space-complexity
lower-bounds
formal-languages
computability
formal-grammars
context-free
parsing
complexity-theory
time-complexity
terminology
turing-machines
nondeterminism
programming-languages
semantics
operational-semantics
complexity-theory
time-complexity
complexity-theory
reference-request
turing-machines
machine-models
simulation
graphs
probability-theory
data-structures
terminology
distributed-systems
hash-tables
history
terminology
programming-languages
meta-programming
terminology
formal-grammars
compilers
algorithms
search-algorithms
formal-languages
regular-languages
complexity-theory
satisfiability
sat-solvers
factoring
algorithms
randomized-algorithms
streaming-algorithm
in-place
algorithms
numerical-analysis
regular-languages
automata
finite-automata
regular-expressions
algorithms
data-structures
efficiency
coding-theory
algorithms
graph-theory
reference-request
education
books
formal-languages
context-free
proof-techniques
algorithms
graph-theory
greedy-algorithms
matroids
complexity-theory
graph-theory
np-complete
intuition
complexity-theory
np-complete
traveling-salesman
algorithms
graphs
probabilistic-algorithms
weighted-graphs
data-structures
time-complexity
priority-queues
computability
turing-machines
automata
pushdown-automata
algorithms
graphs
binary-trees
algorithms
algorithm-analysis
spanning-trees
terminology
asymptotics
landau-notation
algorithms
graph-theory
network-flow
terminology
computability
undecidability
rice-theorem
algorithms
data-structures
computational-geometry