Overview
News
Salaries
Products
People
Growth
Offices
Financials
Overview
Kristopher Micinski. I love thinking about programming, exploring ways to understand programs, developing new paradigms for writing programs, and helping students understand programs. I am an Associate Professor in the Electrical Engineering and Computer Science department at Syracuse University.
News
Puffin - a small, self-hosting functional language
Puffin: a minimal Scheme/ML-like functional language - self-hosting compiler, gradual types, modules, and a typed FFI.
Read more
Report
The Thing We All Obviously Want
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
Read more
Report
My Rejected NSF CAREER Proposal
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
Read more
Report
Report
Report
Why Study CS? Thoughts on LLM-assisted software engineering
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 clai
Read more
Report
Build a Compiler in Five Projects
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
Read more
Report
Why Tail-Recursive Functions are Loops
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 def
Read more
Report
Modern Deduction Post 1: Chain-Forward Computation
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 implemen
Read more
Report
Show more news