I hereby claim:
- I am agnishom on github.
- I am agnishom (https://keybase.io/agnishom) on keybase.
- I have a public key ASBEfGCEQw4cY-VOkwSiHBWosC_4pM60jwJi5AufQzgF2wo
To claim this, I am signing this object:
| import data.fintype | |
| structure dfa (alphabet : Type) [fintype alphabet] := | |
| (qq : Type) {is_finite : fintype qq} {has_decidable_eq : decidable_eq qq} | |
| (δ : qq → alphabet → qq) | |
| (init : qq) | |
| (fin : qq → bool) | |
| def language (alphabet : Type) [fintype alphabet] := list alphabet → bool |
I hereby claim:
To claim this, I am signing this object:
| import Data.List | |
| {- | |
| We are assumming the multiplication is happening in decimal digits. Here is the yardstick with which we are measuring the number of operations | |
| 1. Every single digit multiplication is 1 step | |
| 2. Adding two n-digit numbers is n steps. | |
| Adding an m-digit and an n-digit number takes max(m, n) steps. | |
| Adding two n-digit numbers produce an (n+1)-digit number. |
| {-# LANGUAGE FlexibleContexts #-} | |
| import Control.Monad | |
| import Control.Monad.State | |
| type NonDet a = [a] | |
| type NonDetState s a = StateT s [] a | |
| type Vertex = Int |
I am a final year undergraduate student of Mathematics and (Theoretical) Computer Science studying in Chennai Mathematical Institute, India. My interests in computer science are along the lines of programming languages and logic.
My interest in functional programming began as a leisure activity, but became more serious when I took my first introductory Haskell Course. As time progressed, I educated myself through the means of several internet blogs and other online resources. I also took a follow up course titled "Implementation of Functional Programming" where we discussed the challenges of the implementational aspects of languages with functional abstraction. In the subsequent year, I offered to be the teaching assistant of the same introductory Haskell course which was my initial inspiration. Not only did I tutor this course in my institution, but also over online courses conducted by NPTEL, twice in a row.
Last summer, I interned at a technological start-up VacationLabs, Goa where we used functional p
| Symbolic Analysis Using SMT Solvers (SASS) | |
| Instructor: M.K. SrivasFirst | |
| Meeting: Aug 8 (Wed) 3:30PM, Lec Hall 801 | |
| Satisfiability-Modulo Theory (SMT) solver is a sound algorithmic framework for combining automatic decision procedures for first-order (i.e., quantifier-free) theories of data types, such as propositional logic, un-interpreted functions, bit-vectors, arithmetic, arrays, pointers, etc., that commonly occur in modern programming languages. Advances in SMT solving technology in the recent past have enabled development of tools - interactive theorem provers, model checkers, guided-synthesizers - for practical formal verification and synthesis of sequential and concurrent SW systems. This course covers the theory and practice of SMT solvers providing hands-on exposure to the use of SMT solvers. The topics of the course will be distributed over two not necessarily contiguous parts. The first part will cover the basic principles and theory behind construction of SMT solvers, describing in detail dec |
| import Page exposing (..) | |
| import Http | |
| import Json.Decode as Decode | |
| import Task | |
| import Html | |
| main = | |
| Html.program | |
| { init = init | |
| , view = view |
| update : Msg -> Model -> (Model, Cmd Msg, Maybe LoadingCounter) | |
| update = | |
| case msg of | |
| Produce cmd -> (model, cmd, Just Increment) | |
| Consume -> (model, Cmd.none, Just Decrement) | |
| msg -> | |
| let | |
| (newModel, newCmd) = realUpdate msg model | |
| in | |
| (newModel, newCmd, Nothing) |
| module AnalyticPage exposing (..) | |
| import AutoGen exposing (..) | |
| import Navigation | |
| import Http | |
| import Array | |
| import Html exposing (..) | |
| import Html.Attributes exposing (..) | |
| import FileReader | |
| import Json.Decode |