Filters








4 Hits in 8.3 sec

Random generation of closed simply-typed λ-terms: a synergy between logic programming and Boltzmann samplers [article]

Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
2017 arXiv   pre-print
In this paper we combine the framework of Boltzmann samplers, a powerful technique of random combinatorial structure generation, with today's Prolog systems offering a synergy between logic variables,  ...  This allows us to develop a novel sampling mechanism able to construct uniformly random closed simply-typed λ-terms of up size 120.  ...  Acknowledgements We would like to thank the anonymous referees for their insightful comments and suggestions on the paper.  ... 
arXiv:1612.07682v2 fatcat:mhovxvkdyjdpveiwl5zqpcztxe

A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms [article]

Paul Tarau
2016 arXiv   pre-print
counting or generating the set of simply-typed closed lambda terms of a given size.  ...  by deriving progressively faster Horn Clause programs that generate and/or count the set of closed simply-typed lambda terms of sizes up to 14.  ...  We thank the anonymous reviewers of LOPSTR'16 for their constructive suggestions and the participants of the 9th Workshop Computational Logic and Applications (https://cla.tcs.uj.edu.pl/) for enlightening  ... 
arXiv:1608.03912v1 fatcat:bxppoupkzzcljlpi3f724o37m4

Formula Transformers and Combinatorial Test Generators for Propositional Intuitionistic Theorem Provers [article]

Paul Tarau
2019 arXiv   pre-print
Our algorithms support exhaustive and random generators for formulas of these logics.  ...  Besides generators for several classes of formulas, we design algorithms that restrict formula generation to canonical representatives among equiprovable formulas and introduce program transformations  ...  Acknowledgement We thank the participants to the CLA'2018 and CLA'2019 for their comments and suggestions.  ... 
arXiv:1910.01775v1 fatcat:bbbtx56isjdxnlsetphluha4xy

Best Practices for Alchemical Free Energy Calculations [Article v1.0]

Antonia S.J.S Mey, Bryce K. Allen, Hannah E. Bruce Macdonald, John D. Chodera, David F. Hahn, Maximilian Kuhn, Julien Michel, David L. Mobley, Levi N. Naden, Samarjeet Prasad, Andrea Rizzi, Jenke Scheen (+3 others)
2019 Living journal of computational molecular science  
In this case a docking program can generate initial structures.  ...  For example, bonds can be transformed in both GROMACS and GROMOS, because contributions of LINCS (GROMACS) and SHAKE (GROMOS) contrained bonds are added to the dH dλ term [143] [144] [145] [146] .  ... 
doi:10.33011/2.1.18378 fatcat:g3fda3stxrchhmahqrbwci6ena