A recursion formula for the moments of the Gaussian orthogonal ensemble

Source URL: www.math.univ-toulouse.fr

On Verifying Hennessy-Milner Logic with Recursion at Runtime? Adrian Francalanza1 , Luca Aceto2 , and Anna Ingolfsdottir2 1 2

Source URL: staff.um.edu.mt

CS 116x Winter 2015 Craig S. Kaplan Assignment 06: Recursion and Randomness Due date: Wednesday, 11 March, 12:00pm

Source URL: www.student.cs.uwaterloo.ca

Recursive Query Plans for Data Integration Oliver M. Duschka Michael R. Genesereth Department of Computer Science, Stanford University, Stanford, CA 94305, USA

Source URL: logic.stanford.edu

• Computing
• Data management
• Software engineering
• Database management systems
• SQL
• Recursion
• Conjunctive query
• Database theory
• Datalog
• Data integration
• Query optimization
• Join

Types and Higher-Order Recursion Schemes for Verification of Higher-Order Programs Naoki Kobayashi Tohoku University

Source URL: www-kb.is.s.u-tokyo.ac.jp

Untyped Recursion Schemes and Infinite Intersection Types Takeshi Tsukada and Naoki Kobayashi Tohoku University Abstract. A new framework for higher-order program verification has

Source URL: www-kb.is.s.u-tokyo.ac.jp

A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes Naoki Kobayashi Tohoku University

Source URL: www.kb.ecei.tohoku.ac.jp

Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification Naoki Kobayashi Naoshi Tabuchi

Source URL: www.kb.ecei.tohoku.ac.jp

The Grammar Matrix: An Open-Source Starter-Kit for the Rapid Development of Cross-Linguistically Consistent Broad-Coverage Precision Grammars Emily M. Bender and Dan Flickinger and Stephan Oepen Center for the Study of L

Source URL: faculty.washington.edu

• Linguistics
• Cognitive science
• Grammar
• Natural language processing
• Generative linguistics
• Syntax
• Semantics
• Head-driven phrase structure grammar
• Minimal recursion semantics
• LKB
• Phrase structure grammar
• Parsing

Pumping by Typing Naoki Kobayashi The University of Tokyo Abstract—Higher-order recursion schemes (HORS), which are higher-order grammars for generating infinite trees, have recently

Source URL: www-kb.is.s.u-tokyo.ac.jp