Publications associées à Let expression

Measurement of the ratio of branching fractions of the decays0(2S) and arrange Lambda

Olivier Schneider, Aurelio Bay, Yiming Li, Guido Haefeli, Christoph Frei, Frédéric Blanc, Tatsuya Nakada, Michel De Cian, Elena Graverini, Matthieu Philippe Luther Marinangeli, Luca Pescatore, François Fleuret, Pietro Marino, Sebastiana Gianì, Chitsanu Khurewathanakul, Federico Leo Redi, Maxime Schubiger, Renato Quagliani, Violaine Bellée, Federico Betti, Maria Vieites Diaz, Pavol Stefko, Aravindhan Venkateswaran, Vladimir Macko, Luis Miguel Garcia Martin, Guillaume Max Pietrzyk, Vitalii Lisovskyi, Lino Ferreira Lopes, Jian Wang, Mingkui Wang, Zhirui Xu, Yi Zhang, Lei Zhang, Jessica Prisciandaro, Mark Tobin, Minh Tâm Tran, Niko Neufeld, Matthew Needham, Marc-Olivier Bettler, Greig Alan Cowan, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,

The epsilon expansion meets semiclassics

Riccardo Rattazzi, Alexander Monin, Gil Badel, Gabriel Francisco Cuomo

We study the scaling dimension Delta(phi n) of the operator phi(n) where phi is the fundamental complex field of the U(1) model at the Wilson-Fisher fixed point in d = 4 - epsilon. Even for a perturbatively small fixed point coupling lambda*, standard pert ...

Springer Nature2019

Monotonicity Types for Distributed Dataflow

Heather Christine Klug

The Lasp programming language provides combinator functions such as Union and Intersection for combining set CRDTs. When designing a CRDT combinator, care must be taken to ensure that the combinator is monotone separately in each of its arguments, so that ...

2017

Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (term a ...

2010

Constraint Solving for Software Reliability and Text Analysis

Viktor Kuncak

We will develop and implement new algorithms for constraint solving and apply them to construct two classes of tools: 1) bug finding and verification tools building on tools such as Java PathFinder and Jahob; 2) tools for deep semantic analysis of texts co ...

2008