Hazer Hazer hazer-hazer

Упражнения по формальным доказательствам

Нет времени объяснять, переходим сразу к делу.

Инструменты

Доказывать теоремы мы будем, используя интерактивные пруверы Isabelle или Lean 3. Примеры приводятся для каждого прувера, для решения задач же можно использовать любой из них.

WSL 2 Cisco AnyConnect Networking Workaround

Overview

WSL 2 uses a Hyper-V Virtual Network adapter. Network connectivity works without any issue when a VPN is not in use. However when a Cisco AnyConnect VPN session is established Firewall Rules and Routes are added which breaks connectivity within the WSL 2 VM. This issue is tracked WSL/issues/4277

Below outline steps to automatically configure the Interface metric on VPN connect and update DNS settings (/etc/resolv.conf) on connect/disconnect.

Acknowledges

In this tutorial we're going to build a set of parser combinators.

What is a parser combinator?

We'll answer the above question in 2 steps.

What is a parser?
and, what is a parser combinator?

So first question: What is parser?

THIS GIST WAS MOVED TO TERMSTANDARD/COLORS REPOSITORY.

PLEASE ASK YOUR QUESTIONS OR ADD ANY SUGGESTIONS AS A REPOSITORY ISSUES OR PULL REQUESTS INSTEAD!

	import ulab.numpy as np
	import random
	import synthio

	SAMPLE_SIZE = 200
	sinwave1 = np.array(np.sin(np.linspace(0, 2np.pi, SAMPLE_SIZE, endpoint=False)) 32767, dtype=np.int16)
	sinwave2 = np.array(np.sin(np.linspace(np.pi/2, 2.5np.pi, SAMPLE_SIZE, endpoint=False)) 32767, dtype=np.int16)
	downwave = np.linspace(32767, -32767, num=3, dtype=np.int16)

	noisewave = np.array([random.randint(-32767, 32767) for i in range(SAMPLE_SIZE)], dtype=np.int16)

	type name = string

	module AST = struct
	type ty =
	\| TFun of ty * ty
	\| TNamed of string
	\| TApp of ty * ty

	type exp =
	\| Annot of exp * ty

	#! /usr/bin/env ocamlscript
	Ocaml.ocamlflags := ["-thread"];
	Ocaml.packs := [ "core" ]
	--
	open Core.Std

	type term =
	\| Ident of string
	\| Lambda of string * term
	\| Apply of term * term

	// a typescript implement of hindley-milner type inference
	// reference http://smallshire.org.uk/sufficientlysmall/2010/04/11/a-hindley-milner-type-inference-implementation-in-python/

	/// <reference path="./lib.es6.d.ts" />

	// ...
	interface AstNode {
	}

	class Id implements AstNode {

	#include <cstddef>
	#include <utility>


	template<class T, class... TT>
	struct over_all {
	using next = over_all<TT...>;
	static const constexpr std::size_t size = 1 + next::size;

	template<class C>

	# Makefile for gtest examples

	GOOGLE_TEST_LIB = gtest
	GOOGLE_TEST_INCLUDE = /usr/local/include

	G++ = g++
	G++_FLAGS = -c -Wall -I $(GOOGLE_TEST_INCLUDE)
	LD_FLAGS = -L /usr/local/lib -l $(GOOGLE_TEST_LIB) -l pthread

	OBJECTS = main.o string-compare.o