Results 221 to 230 of about 8,123,913 (272)
Some of the next articles are maybe not open access.

Related searches:

Local type inference

Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98, 1998
We study two partial type inference methods for a language combining subtyping and impredicative polymorphism. Both methods are local in the sense that missing annotations are recovered using only information from adjacent nodes in the syntax tree, without long-distance constraints such as unification variables. One
Benjamin C. Pierce, David N. Turner
openaire   +2 more sources

Efficient local type inference

ACM SIGPLAN Notices, 2008
Inference of static types for local variables in Java bytecode is the first step of any serious tool that manipulates bytecode, be it for decompilation, transformation or analysis. It is important, therefore, to perform that step as accurately and efficiently as possible. Previous work has sought to give solutions with good worst-case complexity.
Ben Bellamy   +3 more
openaire   +2 more sources

Local distinguishability of Bell-type states

Quantum Information Processing, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fakhar Zaman   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy