default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeelakantan R. Krishnaswami
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Jad Elkhaleq Ghalayini
, Neel Krishnaswami:
Explicit Refinement Types. Proc. ACM Program. Lang. 7(ICFP): 187-214 (2023)- [j12]Jeremy Yallop, Ningning Xie, Neel Krishnaswami:
flap: A Deterministic Parser with Fused Lexing. Proc. ACM Program. Lang. 7(PLDI): 1194-1217 (2023) - [j11]Christopher Pulte, Dhruv C. Makwana, Thomas Sewell, Kayvan Memarian, Peter Sewell, Neel Krishnaswami:
CN: Verifying Systems C Code with Separation-Logic Refinement Types. Proc. ACM Program. Lang. 7(POPL): 1-32 (2023) - [j10]Dimitrios J. Economou, Neel Krishnaswami, Jana Dunfield:
Focusing on Refinement Typing. ACM Trans. Program. Lang. Syst. 45(4): 22:1-22:62 (2023) - [i10]Jeremy Yallop, Ningning Xie, Neel Krishnaswami:
flap: A Deterministic Parser with Fused Lexing. CoRR abs/2304.05276 (2023) - [i9]Jad Elkhaleq Ghalayini, Neel Krishnaswami:
Explicit Refinement Types. CoRR abs/2311.13995 (2023) - 2022
- [j9]Jana Dunfield, Neel Krishnaswami:
Bidirectional Typing. ACM Comput. Surv. 54(5): 98:1-98:38 (2022) - [j8]Faustyna Krawiec, Simon Peyton Jones, Neel Krishnaswami, Tom Ellis, Richard A. Eisenberg, Andrew W. Fitzgibbon:
Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - [i8]Henry Mercer, Cameron Ramsay, Neel Krishnaswami:
Implicit Polarized F: local type inference for impredicativity. CoRR abs/2203.01835 (2022) - [i7]Dimitrios J. Economou, Neel Krishnaswami, Jana Dunfield:
Focusing on Liquid Refinement Typing. CoRR abs/2209.13000 (2022) - 2021
- [j7]Simon Spies, Neel Krishnaswami, Derek Dreyer:
Transfinite step-indexing for termination. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [c24]Christian Uldal Graulund, Dmitrij Szamozvancev, Neel Krishnaswami:
Adjoint Reactive GUI Programming. FoSSaCS 2021: 289-309 - 2020
- [j6]Vikraman Choudhury, Neel Krishnaswami:
Recovering purity with comonads and capabilities. Proc. ACM Program. Lang. 4(ICFP): 111:1-111:28 (2020) - [j5]Michael Arntzenius, Neel Krishnaswami:
Seminaïve evaluation for a higher-order functional language. Proc. ACM Program. Lang. 4(POPL): 22:1-22:28 (2020) - [i6]Christian Uldal Graulund, Dmitrij Szamozvancev, Neel Krishnaswami:
Adjoint Reactive GUI. CoRR abs/2010.12338 (2020)
2010 – 2019
- 2019
- [j4]Dhruv C. Makwana, Neelakantan R. Krishnaswami:
NumLin: Linear Types for Linear Algebra (Artifact). Dagstuhl Artifacts Ser. 5(2): 03:1-03:2 (2019) - [j3]Jana Dunfield, Neelakantan R. Krishnaswami:
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types. Proc. ACM Program. Lang. 3(POPL): 9:1-9:28 (2019) - [j2]Alasdair Armstrong, Thomas Bauereiss, Brian Campbell, Alastair Reid, Kathryn E. Gray, Robert M. Norton, Prashanth Mundkur, Mark Wassell, Jon French, Christopher Pulte, Shaked Flur, Ian Stark, Neel Krishnaswami, Peter Sewell:
ISA semantics for ARMv8-a, RISC-v, and CHERI-MIPS. Proc. ACM Program. Lang. 3(POPL): 71:1-71:31 (2019) - [c23]Conrad Watt, Petar Maksimovic, Neelakantan R. Krishnaswami, Philippa Gardner:
A Program Logic for First-Order Encapsulated WebAssembly. ECOOP 2019: 9:1-9:30 - [c22]Dhruv C. Makwana, Neelakantan R. Krishnaswami:
NumLin: Linear Types for Linear Algebra. ECOOP 2019: 14:1-14:25 - [c21]Yan Han, Nada Amin, Neel Krishnaswami:
Representing music with prefix trees. FARM@ICFP 2019: 83-94 - [c20]Neelakantan R. Krishnaswami, Jeremy Yallop:
A typed, algebraic approach to parsing. PLDI 2019: 379-393 - [i5]Vikraman Choudhury, Neel Krishnaswami:
Recovering Purity with Comonads and Capabilities. CoRR abs/1907.07283 (2019) - [i4]Jana Dunfield, Neel Krishnaswami:
Bidirectional Typing. CoRR abs/1908.05839 (2019) - 2018
- [i3]Conrad Watt, Petar Maksimovic, Neelakantan R. Krishnaswami, Philippa Gardner:
A Program Logic for First-Order Encapsulated WebAssembly. CoRR abs/1811.03479 (2018) - 2016
- [c19]Michael Arntzenius, Neelakantan R. Krishnaswami:
Datafun: a functional Datalog. ICFP 2016: 214-227 - [e2]Robert Atkey, Neelakantan R. Krishnaswami:
Proceedings 6th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2016, Eindhoven, Netherlands, 8th April 2016. EPTCS 207, 2016 [contents] - [i2]Jana Dunfield, Neelakantan R. Krishnaswami:
Sound and Complete Bidirectional Typechecking for Higher-Rank Polymorphism with Existentials and Indexed Types. CoRR abs/1601.05106 (2016) - 2015
- [j1]Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski, Viktor Vafeiadis:
Mtac: A monad for typed tactic programming in Coq. J. Funct. Program. 25 (2015) - [c18]Neelakantan R. Krishnaswami, Cécilia Pradic, Nick Benton:
Integrating Linear and Dependent Types. POPL 2015: 17-30 - 2014
- [c17]Lindsey Kuper, Aaron Turon, Neelakantan R. Krishnaswami, Ryan R. Newton:
Freeze after writing: quasi-deterministic parallel programming with LVars. POPL 2014: 257-270 - [e1]Paul Blain Levy, Neel Krishnaswami:
Proceedings 5th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2014, Grenoble, France, 12 April 2014. EPTCS 153, 2014 [contents] - 2013
- [c16]Neelakantan R. Krishnaswami, Derek Dreyer:
Internalizing Relational Parametricity in the Extensional Calculus of Constructions. CSL 2013: 432-451 - [c15]Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski, Viktor Vafeiadis:
Mtac: a monad for typed tactic programming in Coq. ICFP 2013: 87-100 - [c14]Neelakantan R. Krishnaswami:
Higher-order functional reactive programming without spacetime leaks. ICFP 2013: 221-232 - [c13]Jana Dunfield, Neelakantan R. Krishnaswami:
Complete and easy bidirectional typechecking for higher-rank polymorphism. ICFP 2013: 429-442 - [i1]Jana Dunfield, Neelakantan R. Krishnaswami:
Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism. CoRR abs/1306.6032 (2013) - 2012
- [b1]Neelakantan R. Krishnaswami:
Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic. Carnegie Mellon University, USA, 2012 - [c12]Neelakantan R. Krishnaswami, Nick Benton:
Adding Equations to System F Types. ESOP 2012: 417-435 - [c11]Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, Deepak Garg:
Superficially substructural types. ICFP 2012: 41-54 - [c10]Neelakantan R. Krishnaswami, Nick Benton, Jan Hoffmann:
Higher-order functional reactive programming in bounded space. POPL 2012: 45-58 - [c9]Neelakantan R. Krishnaswami:
Semantics for graphical user interfaces. TLDI 2012: 51-52 - 2011
- [c8]Neelakantan R. Krishnaswami, Nick Benton:
A semantic model for graphical user interfaces. ICFP 2011: 45-57 - [c7]Neelakantan R. Krishnaswami, Nick Benton:
Ultrametric Semantics of Reactive Programs. LICS 2011: 257-266 - 2010
- [c6]Neel Krishnaswami, Lars Birkedal, Jonathan Aldrich:
Verifying event-driven programs using ramified frame properties. TLDI 2010: 63-76
2000 – 2009
- 2009
- [c5]Neelakantan R. Krishnaswami:
Focusing on pattern matching. POPL 2009: 366-378 - [c4]Neelakantan R. Krishnaswami, Jonathan Aldrich, Lars Birkedal, Kasper Svendsen, Alexandre Buisse:
Design patterns in separation logic. TLDI 2009: 105-116 - 2006
- [c3]Neelakantan R. Krishnaswami:
Reasoning about iterators with separation logic. SAVCBS@FSE 2006: 83-86 - 2005
- [c2]Neelakantan R. Krishnaswami, Jonathan Aldrich:
Permission-based ownership: encapsulating state in higher-order typed languages. PLDI 2005: 96-106 - 2004
- [c1]Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, Stephen Magill, Sungwoo Park:
The Inverse Method for the Logic of Bunched Implications. LPAR 2004: 466-480
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
