Learning descriptors for object recognition and 3d pose estimation
P Wohlhart, V Lepetit - … of the IEEE conference on computer …, 2015 - openaccess.thecvf.com
Detecting poorly textured objects and estimating their 3D pose reliably is still a very
challenging problem. We introduce a simple but powerful approach to computing descriptors …
challenging problem. We introduce a simple but powerful approach to computing descriptors …
Productive coprogramming with guarded recursion
Total functional programming offers the beguiling vision that, just by virtue of the compiler
accepting a program, we are guaranteed that it will always terminate. In the case of …
accepting a program, we are guaranteed that it will always terminate. In the case of …
Distributed REScala: An update algorithm for distributed reactive programming
Reactive programming improves the design of reactive applications by relocating the logic
for managing dependencies between dependent values away from the application logic to …
for managing dependencies between dependent values away from the application logic to …
The clocks are ticking: No more delays!
P Bahr, HB Grathwohl… - 2017 32nd Annual ACM …, 2017 - ieeexplore.ieee.org
Guarded recursion in the sense of Nakano allows general recursive types and terms to be
added to type theory without breaking consistency. Recent work has demonstrated …
added to type theory without breaking consistency. Recent work has demonstrated …
Dual-context calculi for modal logic
GA Kavvos - Logical Methods in Computer Science, 2020 - lmcs.episciences.org
We present natural deduction systems and associated modal lambda calculi for the
necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in …
necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in …
Programming and reasoning with guarded recursion for coinductive types
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus
with guarded recursive and coinductive types. The use of guarded recursive types ensures …
with guarded recursive and coinductive types. The use of guarded recursive types ensures …
The guarded lambda-calculus: Programming and reasoning with guarded recursion for coinductive types
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus
with guarded recursive and coinductive types. The use of guarded recursive types ensures …
with guarded recursive and coinductive types. The use of guarded recursive types ensures …
[PDF][PDF] Nominal coalgebraic data types with applications to lambda calculus
NOMINAL COALGEBRAIC DATA TYPES WITH APPLICATIONS TO LAMBDA CALCULUS
Contents 1. Introduction 2 2. Preliminaries on Algebra and C Page 1 Logical Methods in …
Contents 1. Introduction 2 2. Preliminaries on Algebra and C Page 1 Logical Methods in …
Type-based productivity of stream definitions in the calculus of constructions
JL Sacchini - 2013 28th Annual ACM/IEEE Symposium on …, 2013 - ieeexplore.ieee.org
Productivity of corecursive definitions is an essential property in proof assistants since it
ensures logical consistency and decidability of type checking. Type-based mechanisms for …
ensures logical consistency and decidability of type checking. Type-based mechanisms for …
Circular coinduction in Coq using bisimulation-up-to techniques
We investigate methods for proving equality of infinite objects using circular coinduction, a
combination of coinduction with term rewriting, in the Coq proof assistant. In order to ensure …
combination of coinduction with term rewriting, in the Coq proof assistant. In order to ensure …