Kris Micinski's Website. Love the lambda.
Generated by AI—notice the perspective. Over the past year, we have seen the rapid development of AI-assisted programming to an astounding degree. Even five years ago, fully-automated program synthesis of large-scale, production systems would have seemed unthinkable. Today, this is not an ambition, it is a reality, at least by some measure. To some computer scientists,…
My NSF CAREER proposal was rejected, and I’m making it publicly available: Micinski CAREER Proposal (PDF) . The proposals scores were VG/G, VG/G, and E/VG. While the proposal was rejected as competitive, my position is that the proposal is nicely written and addresses a serious and important challenge in a credible way. I also notice that the only PIs who have had NSF CAREER proposals funded this…
Dear students of Computer Science, Almost everything everyone is telling you about LLMs is probably wrong. Some tell you it’s glorified autocomplete, others say it will cure cancer or prove the loftiest theorems. As with many mass-market takes, these claims contain a grain of truth–but they miss the point. I encourage you to try a modern AI coding assistant for yourself and form your own opinion;…
Class website here: https://kmicinski.com/cis531-f25 Are you interested in building a compiler? Learning how functional languages are implemented? Gaining a bit of practical experience with x86-64 assembly language? If so, I invite you to try your hand at the projects in my class, CIS531 . CIS531 is a masters-level class on compiler design which assumes that (a) you know how to program, (b) you’ve…
One story every computing enthusiast should hear is the lesson of how loops and tail-recursion are equivalent. We like recursive functions because they’re amenable to induction, and we can derive them in a way that is in direct correspondence with the definition of the datatype over which they recur. We like loops because they’re fast and make intuitive sense as long as variables don’t change in…
Our setting is logic programming, a field which attempts to design programming languages whose semantics have a close relationship to formal logic. The reason we might want to do this is that it suits our application domain more precisely than an implementation in a traditional programming language. Thus, using a logic programming language allows us to write more obviously-correct code, and…
Over the past few years, my collaborators and I have been exploring the design of high-performance logic programming engines for a wide variety of tasks, including program analysis (points-to analysis, abstract interpretation), graph analytics (transitive closure, PageRank), and security (binary code similarity, disassembly, and decompilation). We (myself, my collaborators, and our students) have…
This page holds my “year 3 review” materials for evaluation and promotion at Syracuse University. My detailed personal statement (including teaching and research statements) is here My current CV is linked here A (~22MB) zip file linked here gives the full review packet, including CV, papers, and my personal statement.
When I began programming, I read a copy of Richard Steven’s “Programming in the UNIX Environment.” Ultimately, my early experimentations with C were a failure; however, I later read David Beazley’s “Python: Essential Reference,” and was quickly able to pick up the UNIX API via it’s much simpler (admittedly, largely due to Beazley’s writing) Python counterpart. After teaching my undergraduate PL…
Link to this year’s Scheme Workshop CFP This year marks the twentieth anniversary of the workshop on Scheme and Functional Programming . The Scheme Workshop represents a diverse community of hackers, academics, and enthusiasts. The workshop offers a forum to share insights, experience, and technical developments of and within the Scheme family of programming languages. Rather than focus on a…