Emir Pasalic

Followers

Following

Public Views

Hasan Çolak

TOBB University of Economics and Technology

Necati Alkan

Independent Scholar

Paolo Maggiolini

Università Cattolica del Sacro Cuore (Catholic University of the Sacred Heart)

Abigail Jacobson

The Hebrew University of Jerusalem

Halim Kılıç

Ankara Hacı Bayram Veli University

Viacheslav Kuleshov

Stockholm University

Vjeran Kursar

University of Zagreb, Faculty of Humanities and Social Sciences [Filozofski fakultet]

Adis Zilić

Dzemal Bijedic University of Mostar

Charalambos GASPARIS

National Hellenic Research Foundation

Amy Singer

Brandeis University

Interests

Uploads

Papers by Emir Pasalic

The role of type equality in meta-programming

DALI: an untyped CBV operational semantics and equational theory for datatypes with binders (Technical Development)

SolverBlox: algebraic modeling in datalog

Declarative Logic Programming: Theory, Systems, and Applications, 2018

Datalog is a deductive query language for relational databases. We introduce LogiQL, a language b... more Datalog is a deductive query language for relational databases. We introduce LogiQL, a language based on Datalog and show how it can be used to specify mixedinteger linear optimization models and solve them. Unlike pure algebraic modeling languages, LogiQL allows the user to both specify models, and manipulate and transform the inputs and outputs of the models. This is an advantage over conventional optimization modeling languages that rely on reading data via plug-in tools or importing data from external sources via files. In this chapter, we give a brief overview of LogiQL and describe two mixed integer programming case studies: a production-transportation model and a formulation of the traveling salesman problem.

Modelling Machine Learning Algorithms on Relational Data with Datalog

Proceedings of the Second Workshop on Data Management for End-To-End Machine Learning, 2018

The standard process of data science tasks is to prepare features inside a database, export them ... more The standard process of data science tasks is to prepare features inside a database, export them as a denormalized data frame and then apply machine learning algorithms. This process is not optimal for two reasons. First, it requires denormalization of the database that can convert a small data problem into a big data problem. The second shortcoming is that it assumes that the machine learning algorithm is disentangled from the relational model of the problem. That seems to be a serious limitation since the relational model contains very valuable domain expertise. In this paper we explore the use of convex optimization and specifically linear programming, for modelling machine learning algorithms on relational data in an integrated way with data processing operators. We are using SolverBlox, a framework that accepts as an input Datalog code and feeds it into a linear programming solver. We demonstrate the expression of common machine learning algorithms and present use case scenarios where combining data processing with modelling of optimization problems inside a database offers significant advantages.

Download

A Plug and Play Architecture for Probabilistic Programming

: In the probabilistic-programming paradigm, the application logic is specified by means of a des... more : In the probabilistic-programming paradigm, the application logic is specified by means of a description of a probabilistic model (by stating how a sample is being produced) using a Probabilistic Programming Language (PPL). The principal value one obtains from a probabilistic program lies in the inference thereof, that is, reasoning about the entire probability distribution that the program defines (e.g., finding a likely event or estimating its marginal probability). The PPAML kickoff meeting highlighted several research challenges regarding the development of inference infrastructure for PPL, for both increasing software efficiency and reducing software complexity, towards the goal of broadening the PPL applications and the community of implementers and programmers. These challenges include the design of an Application Program Interface (API), or alternatively an Intermediate Representation Language (IRL), that would allow new solvers to be plugged into existing PPLs, and for PPL...

Extending Datalog with Analytics in LogicBlox

LogicBlox is a database product designed for enterprise software development, combining transacti... more LogicBlox is a database product designed for enterprise software development, combining transactions and analytics. The underying data model is a relational database, and the query language, LogiQL, is an extension of Datalog [13]. As such, LogiQL features a simple and unified syntax for traditional relational manipulation as well as deeper analytics. Moreover, its declarative nature allows for substantial static analysis for optimizing evaluation schemes, parallelization, and incremental maintenance, and it allows for sophisticated transactional management [11]. In this paper, we describe various extensions of Datalog for supporting prescriptive and predictive analytics. These extensions come in the form of mathematical optimization (mixed integer programming), machine-learning capabilities, statistical relational models, and probabilistic programming. Some of these extensions are currently implemented in LogicQL, while others are in either development or planning phases.

Download

Application of Metaprogramming to Program Generation

Writing (meta-)programs that manipulate other (object-) programs poses significant technical prob... more Writing (meta-)programs that manipulate other (object-) programs poses significant technical problems when the objectlanguage itself has a notion of binders and variable occurrences. Higher-order abstract syntax is a representation of object programs that has recently been the focus of several studies. This paper points out a number of limitations of using higher order syntax in a functional context, and argues that DALI, a language based on a simple and elegant proposal made by Dale Miller ten years ago can provide superior support for manipulating such object-languages. Miller's original proposal, however, did not provide any formal treatment. To fill this gap, we present both a big-step and a reduction semantics for DALI, and summarize the results of our extensive study of the semantics, including the rather involved proof of the soundness of the reduction semantics with respect to the big-step semantics. Because our formal development is carried out for the untyped version of the language, we hope it will serve as a solid basis for investigating type system(s) for DALI.

Download

Domain Specific Language Construction Technology

Systems and Methods for Identifying Sets of Similar Products

Meta-programming with Built-in Type Equality (Extended Abstract)

We report our experience with exploring a new point in the design space for formal reasoning syst... more We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a practical programming language and a logic. The main goal of mega is to allow programmers to describe and reason about semantic properties of programs from within the programming language itself, mainly by using a powerful type system. We illustrate the main features of mega by developing an interesting meta-programming example. First, we show how to encode a set of well-typed simply typed �-calculus terms as an mega data-type. Then, we show how to implement a substitution operation on these terms that is guaranteed by the mega type system to preserve their well-typedness.

The dissertation “The Role of Type Equality in Meta-programming ” by Emir Pasalic has been examined and approved by the following Examination Committee

ii To my parents Dedication iii

Beyond interoperability-tracking and managing the results of computational applications

Proceedings. Ninth International Conference on Scientific and Statistical Database Management (Cat. No.97TB100150), 1997

ABSTRACT Molecular biology applications, like those of other scientific domains, need to store an... more ABSTRACT Molecular biology applications, like those of other scientific domains, need to store and view large amounts of specialized quantitative information. With the advent of high speed sequencing technology and considerable funding to ``map&quot; the genomes of key biological organisms, public databases such as GenBank, PDB, EMBL, JIPID, and SwissProt make millions of genetic sequences available to molecular biologists, and industry and university laboratories maintain large databases. The need for common interfaces and query languages to exploit these heterogeneous databases is well documented, and several such systems now exist or are under development. Our own work on database and program interoperability in this domain has shown, however, that providing an interface is but a first step towards making these databases fully useful.The system we are developing integrates and tracks inputs and results from numerous computational biology programs. It helps researchers organize result items from sequence comparisons into ``clusters&quot; that can be marked, named, annotated, and manipulated. An alpha version is implemented in Smalltalk.This paper describes the scientific problem our system aims to solve, as well as current barriers to development and research opportunities suggested by those barriers. We present its conceptual data model, the current prototype, and future implementation plans.

Design and Implementation of the LogicBlox System

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015

The LogicBlox system aims to reduce the complexity of software development for modern application... more The LogicBlox system aims to reduce the complexity of software development for modern applications which enhance and automate decision-making and enable their users to evolve their capabilities via a "self-service" model. Our perspective in this area is informed by over twenty years of experience building dozens of missioncritical enterprise applications that are in use by hundreds of large enterprises across industries such as retail, telecommunications, banking, and government. We designed and built LogicBlox to be the system we wished we had when developing those applications. In this paper, we discuss the design considerations behind the LogicBlox system and give an overview of its implementation, highlighting innovative aspects. These include: LogiQL, a unified and declarative language based on Datalog; the use of purely functional data structures; novel join processing strategies; advanced incremental maintenance and live programming facilities; a novel concurrency control scheme; and built-in support for prescriptive and predictive analytics.

Download

Concoqtion

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, 2007

Almost twenty years after the pioneering efforts of Cardelli, the programming languages community... more Almost twenty years after the pioneering efforts of Cardelli, the programming languages community is vigorously pursuing ways to incorporate Fω-style indexed types into programming languages. This paper advocates Concoqtion, a practical approach to adding such highly expressive types to full-fledged programming languages. The approach is applied to MetaOCaml using the Coq proof checker to conservatively extend Hindley-Milner type inference. The implementation of MetaOCaml Concoqtion requires minimal modifications to the syntax, the type checker, and the compiler; and yields a language comparable in notation to the leading proposals. The resulting language provides unlimited expressiveness in the type system while maintaining decidability. Furthermore, programmers can take advantage of a wide range of libraries not only for the programming language but also for the indexed types. Programming in MetaOCaml Concoqtion is illustrated with small examples and a case study implementing a statically-typed domain-specific language.

Download

A monadic approach for avoiding code duplication when staging memoized functions

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, 2006

Building program generators that do not duplicate generated code can be challenging. At the same ... more Building program generators that do not duplicate generated code can be challenging. At the same time, code duplication can easily increase both generation time and runtime of generated programs by an exponential factor. We identify an instance of this problem that can arise when memoized functions are staged. Without addressing this problem, it would be impossible to effectively stage dynamic programming algorithms. Intuitively, direct staging undoes the effect of memoization. To solve this problem once and for all, and for any function that uses memoization, we propose a staged monadic combinator library. Experimental results confirm that the library works as expected. Preliminary results also indicate that the library is useful even when memoization is not used.

Download

Typed Datalog

Practical Aspects of Declarative Languages, 2008

ABSTRACT Static type safety is an important feature of many commercial programming languages, as ... more ABSTRACT Static type safety is an important feature of many commercial programming languages, as has become apparent in our experience developing LogicBlox—a Datalog-based platform for building enterprise-scale systems for corporate planning. Existing approaches to enhancing Datalog (and Prolog) with type safety are problematic for LogicBlox applications because (1) they do not support inclusion constraints, which are crucial for database reasoning, and (2) their worst-case running times are exponential in the size of the programs. In the LogicBlox environment—where clients interactively add and execute programs and queries—efficient compilation and execution are critical, and so a PTIME type-checking algorithm is preferred. Furthermore, one of the central design goals of LogicBlox is to express the compiler itself in Datalog, which in general excludes exponential-time algorithms. This paper presents a definition of type safety for Datalog which can express inclusion constraints along with an efficient (PTIME) and sound (but not complete) type-checking algorithm, proposes work-arounds for some common limitations of the algorithm, and indicates how the type-checking algorithm itself may be represented in Datalog.

Meta-programming with Typed Object-Language Representations

Lecture Notes in Computer Science, 2004

Tagless staged interpreters for typed languages

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, 2002

DSL implementation using staging and monads

Proceedings of the 2nd conference on Domain-specific languages, 1999

The impact of Domain Specific Languages (DSLs) on software design is considerable. They allow pro... more The impact of Domain Specific Languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a highlevel language, and perhaps most importantly they can be written by domain experts rather than programmers. The problem is that DSL implementation is costly and prone to errors, and that high level approaches to DSL implementation often produce inefficient systems. By using two new programming language mechanisms, program staging and monadic abstraction, we can lower the cost of DSL implementations by allowing reuse at many levels. These mechanisms provide the expressive power that allows the construction of many compiler components as reusable libraries, provide a direct link between the semantics and the low-level implementation, and provide the structure necessary to reason about the implementation.

Download

MetaOCaml: A compiled, type-safe multi-stage programming language

… http://www. cs. rice. edu/taha/MetaOCaml, 2001

The role of type equality in meta-programming

DALI: an untyped CBV operational semantics and equational theory for datatypes with binders (Technical Development)

SolverBlox: algebraic modeling in datalog

Declarative Logic Programming: Theory, Systems, and Applications, 2018

Modelling Machine Learning Algorithms on Relational Data with Datalog

Proceedings of the Second Workshop on Data Management for End-To-End Machine Learning, 2018

Download

A Plug and Play Architecture for Probabilistic Programming

Extending Datalog with Analytics in LogicBlox

Download

Application of Metaprogramming to Program Generation

Download

Domain Specific Language Construction Technology

Systems and Methods for Identifying Sets of Similar Products

Meta-programming with Built-in Type Equality (Extended Abstract)

The dissertation “The Role of Type Equality in Meta-programming ” by Emir Pasalic has been examined and approved by the following Examination Committee

ii To my parents Dedication iii

Beyond interoperability-tracking and managing the results of computational applications

Proceedings. Ninth International Conference on Scientific and Statistical Database Management (Cat. No.97TB100150), 1997

Design and Implementation of the LogicBlox System

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015

Download

Concoqtion

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, 2007

Download

A monadic approach for avoiding code duplication when staging memoized functions

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, 2006

Download

Typed Datalog

Practical Aspects of Declarative Languages, 2008

Meta-programming with Typed Object-Language Representations

Lecture Notes in Computer Science, 2004

Tagless staged interpreters for typed languages

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, 2002

DSL implementation using staging and monads

Proceedings of the 2nd conference on Domain-specific languages, 1999

Download

MetaOCaml: A compiled, type-safe multi-stage programming language

… http://www. cs. rice. edu/taha/MetaOCaml, 2001

Emir Pasalic

Uploads

Papers by Emir Pasalic

Log In